06111 Executive Summary – Complexity of Boolean Functions

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

Thumbnail PDF


  • Filesize: 98 kB
  • 5 pages

Document Identifiers

Author Details

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

Cite AsGet BibTex

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


We briefly describe the state of the art concerning the complexity of discrete functions. Computational models and analytical techniques are summarized. After describing the formal organization of the Dagstuhl seminar "Complexity of Boolean Functions" held in March 2006, we introduce the different topics that have been discussed there and mention some of the major achievements. The summary closes with an outlook on the development of discrete computational complexity in the future.
  • Boolean and quantum circuits
  • discrete problems
  • computational complexity
  • lower bounds
  • communication complexity
  • proof and query complexity
  • randomization
  • pseudo-randomness
  • derandomization
  • approximation
  • cryptography
  • computational learning


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