Complexity and Realization of Boolean Functions

Organizer

R. Reischuk, D. Uhlig

For support, please contact

Dagstuhl Service Team

Documents

Dagstuhl-Seminar-Report 45

Dagstuhl Seminar Series

21121: "Computational Complexity of Discrete Problems" (2021)
19121: "Computational Complexity of Discrete Problems" (2019)
17121: "Computational Complexity of Discrete Problems" (2017)
14121: "Computational Complexity of Discrete Problems" (2014)
11121: "Computational Complexity of Discrete Problems" (2011)
08381: "Computational Complexity of Discrete Problems" (2008)
06111: "Complexity of Boolean Functions " (2006)
04141: "Complexity of Boolean Functions" (2004)
02121: "Complexity of Boolean Functions" (2002)
99441: "Complexity of Boolean Functions" (1999)
9711: "Complexity of Boolean Functions" (1997)

Documentation

In the series Dagstuhl Reports each Dagstuhl Seminar and Dagstuhl Perspectives Workshop is documented. The seminar organizers, in cooperation with the collector, prepare a report that includes contributions from the participants' talks together with a summary of the seminar.

Download overview leaflet (PDF).

Publications

Furthermore, a comprehensive peer-reviewed collection of research papers can be published in the series Dagstuhl Follow-Ups.

Dagstuhl's Impact

Please inform us when a publication was published as a result from your seminar. These publications are listed in the category Dagstuhl's Impact and are presented on a special shelf on the ground floor of the library.