"Complexity of Boolean Functions, 12.03. - 17.03.2006"

Matthias Krause et al. (2006)

> Home

Details and statistics

DOI: —

access: open

type: Editorship

metadata version: 2021-06-10

- view
  - table of contents in dblp
  - electronic edition @ dagstuhl.de (open access)
- export record
  dblp key:
  - conf/dagstuhl/2006P6111
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dagstuhl/2006P6111
Matthias Krause, Pavel Pudlák, Rüdiger Reischuk, Dieter van Melkebeek:
Complexity of Boolean Functions, 12.03. - 17.03.2006. Dagstuhl Seminar Proceedings 06111, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006 [contents]

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.