2026-07-20T06:35:14Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:759 2024-03-06T11:06:45Z ddc:004 open_access

06111 Abstracts Collection – Complexity of Boolean Functions Krause, Matthias Pudlák, Pavel Reischuk, Rüdiger van Melkebeek, Dieter Complexity of Boolean functions Boolean circuits binary decision diagrams lower bound proof techniques combinatorics of Boolean functions communi algorithmic learning cryptography derandomization 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Matthias Krause and Pavel Pudlák and Rüdiger Reischuk and Dieter van Melkebeek 2006 Is Part Of Dagstuhl Seminar Proceedings, Volume 6111, Complexity of Boolean Functions (2006) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.06111.1 urn:nbn:de:0030-drops-7593 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06111.1 eng https://creativecommons.org/licenses/by/4.0/legalcode