DagSemProc.06111.1.pdf
- Filesize: 310 kB
- 24 pages
Document
06111 Abstracts Collection – Complexity of Boolean Functions
Authors
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 6111
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2006-12-07
Cite As Get 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)
https://doi.org/10.4230/DagSemProc.06111.1
Abstract
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.
Subject Classification
Keywords
- Complexity of Boolean functions
- Boolean circuits
- binary decision diagrams
- lower bound proof techniques
- combinatorics of Boolean functions
- communi algorithmic learning
- cryptography
- derandomization
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads