06111 Abstracts Collection – Complexity of Boolean Functions

Authors Matthias Krause, Pavel Pudlák, Rüdiger Reischuk, Dieter van Melkebeek

Thumbnail PDF


  • Filesize: 310 kB
  • 24 pages

Document Identifiers

Author Details

Matthias Krause
Pavel Pudlák
Rüdiger Reischuk
Dieter van Melkebeek

Cite AsGet BibTex

Matthias Krause, Pavel Pudlák, Rüdiger Reischuk, and Dieter van Melkebeek. 06111 Abstracts Collection – Complexity of Boolean Functions. In Complexity of Boolean Functions. Dagstuhl Seminar Proceedings, Volume 6111, pp. 1-24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)


From 12.03.06 to 17.03.06, the Dagstuhl Seminar 06111 ``Complexity of Boolean Functions'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and 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 paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
  • Complexity of Boolean functions
  • Boolean circuits
  • binary decision diagrams
  • lower bound proof techniques
  • combinatorics of Boolean functions
  • communi algorithmic learning
  • cryptography
  • derandomization


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads