License
When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-7593
URL: http://drops.dagstuhl.de/opus/volltexte/2006/759/
Go to the corresponding Portal


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

06111 Abstracts Collection -- Complexity of Boolean Functions

pdf-format:
Document 1.pdf (310 KB)


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.

BibTeX - Entry

@InProceedings{krause_et_al:DSP:2006:759,
  author =	{Matthias Krause and Pavel Pudl{\'a}k and R{\"u}diger Reischuk and Dieter van Melkebeek},
  title =	{06111 Abstracts Collection -- Complexity of Boolean Functions},
  booktitle =	{Complexity of Boolean Functions},
  year =	{2006},
  editor =	{Matthias Krause and Pavel Pudl{\'a}k and R{\"u}diger Reischuk and Dieter van Melkebeek},
  number =	{06111},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2006/759},
  annote =	{Keywords: Complexity of Boolean functions, Boolean circuits, binary decision diagrams, lower bound proof techniques, combinatorics of Boolean functions, communi}
}

Keywords: Complexity of Boolean functions, Boolean circuits, binary decision diagrams, lower bound proof techniques, combinatorics of Boolean functions, communi
Freie Schlagwörter (englisch): algorithmic learning, cryptography, derandomization
Seminar: 06111 - Complexity of Boolean Functions
Issue Date: 2006
Date of publication: 07.12.2006


DROPS-Home | Fulltext Search | Imprint Published by LZI