2008/01/01 by Peter Bro Miltersen, Rüdiger Reischuk, Miltersen, Peter Bro +5
Computer Science · #Cellular Automata and Applications #Computational complexity #Optimization and Search Problems #Turing machines #circuits #communication complexity #computational learning #cryptography #derandomization #discrete problems #hardness of approximation #proof complexity #pseudorandomness #query complexity
paper · doi:10.4230/dagsemproc.08381.1
openalex publication_date 2008/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
From the 14th of September to the 19th of September, the Dagstuhl Seminar 08381 ``Computational Complexity of Discrete Problems'' was held in Schloss Dagstuhl - Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work as well as open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this report. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.