Dagstuhl Seminar 9711
Complexity of Boolean Functions
( Mar 10 – Mar 14, 1997 )
Permalink
Please use the following short url to reference this page:
https://www.dagstuhl.de/9711
Organizers
- D. Barrington (Amherst)
- I. Wegener (Dortmund)
- N. Nisan (Jerusalem)
- R. Reischuk (Lübeck)
Contact
Impacts
- No feasible interpolation for TC0-Frege proofs : article pp. 254 - 263 : FOCS 1997 : 38th Annual Symposium on Foundations of Computer Science, 1997 : Proceedings - Bonet, Maria Luisa; Pitassi, Toniann; Raz, Ran - Los Alamitos : IEEE, 1997. - pp. 254 - 263.
- On Interpolation and Automatization for Frege Systems : article : pp. 1939-1967 - Bonet, Maria Luisa; Pitassi, Toniann; Raz, Ran - Philadelphia : SIAM, 1997 - (SIAM journal on computing : 29. 1997, 6).
- Separation of the monotone NC hierarchy : article pp. 234-243 : FOCS 1997 : 38th Annual Symposium on Foundations of Computer Science, 1997 : Proceedings - Raz, Ran; McKenzie, Pierre.
One of the most fundamental problems in computer science is to estimate the complexity of Boolean functions with respect to different models and complexity measures. It is frustrating that several central problems have remained open for a long time, such as proving (1) nonlinear size lower bounds for circuits of logarithmic depth, (2) nonpolynomial size lower bounds for formulas, or (3) nonpolynomial size lower bounds for threshold circuits of depth three. Nevertheless, there has been a lot of progress on some of the classical research problems. Also, new methods such as communication complexity are now available, and new applications (such as hardware verification) pose new problems which can be answered by those people active in this area.
The organizers (David Mix Barrington, Noam Nisan, Rüdiger Reischuk, and Ingo Wegener) are happy that 40 researchers came to the Dagstuhl seminar, only 14 of them from Germany (including three guests from India and Lithuania) with the others from the USA (10), Israel (5), Czech Republic (3), Austria, Canada, Denmark, Hungary, the Netherlands, Russia, Spain, and Sweden.
The 31 talks captured many of the aspects of Boolean function complexity: lower bounds for different types of circuits and branching programs, the average delay of circuits, the power of restrictions, communication complexity, applications to neural nets, and structural results on circuit-based complexity classes. It was discussed whether some lower bound proofs, including proofs that are not ”natural” in the sense of Razborov and Rudich, are even possible. Furthermore, some talks considered related areas such as the PCP theorem, Yao’s XOR lemma, visual cryptography, PRAM complexity, and hashing.
A lively problem session was organized, where 13 open problems were presented. There was also an open discussion on the future of this research topic. Needless to say, the participants took advantage of the Dagstuhl facilities and the excellent atmosphere to hold many informal discussions as well.
Creative Commons BY 3.0 Unported license
- D. Barrington (Amherst)
- I. Wegener (Dortmund)
- N. Nisan (Jerusalem)
- R. Reischuk (Lübeck)
Related Seminars
- Dagstuhl Seminar 9235: Complexity and Realization of Boolean Functions (1992-08-24 - 1992-08-28) (Details)
- Dagstuhl Seminar 99441: Complexity of Boolean Functions (1999-10-31 - 1999-11-05) (Details)
- Dagstuhl Seminar 02121: Complexity of Boolean Functions (2002-03-17 - 2002-03-22) (Details)
- Dagstuhl Seminar 04141: Complexity of Boolean Functions (2004-03-28 - 2004-04-02) (Details)
- Dagstuhl Seminar 06111: Complexity of Boolean Functions (2006-03-12 - 2006-03-17) (Details)
- Dagstuhl Seminar 08381: Computational Complexity of Discrete Problems (2008-09-14 - 2008-09-19) (Details)
- Dagstuhl Seminar 11121: Computational Complexity of Discrete Problems (2011-03-20 - 2011-03-25) (Details)
- Dagstuhl Seminar 14121: Computational Complexity of Discrete Problems (2014-03-16 - 2014-03-21) (Details)
- Dagstuhl Seminar 17121: Computational Complexity of Discrete Problems (2017-03-19 - 2017-03-24) (Details)
- Dagstuhl Seminar 19121: Computational Complexity of Discrete Problems (2019-03-17 - 2019-03-22) (Details)
- Dagstuhl Seminar 21121: Computational Complexity of Discrete Problems (2021-03-21 - 2021-03-26) (Details)
- Dagstuhl Seminar 23111: Computational Complexity of Discrete Problems (2023-03-12 - 2023-03-17) (Details)
- Dagstuhl Seminar 25111: Computational Complexity of Discrete Problems (2025-03-09 - 2025-03-14) (Details)
