http://www.dagstuhl.de/9711
10.03.97 14.03.97, Seminar 9711
Complexity of Boolean Functions
Organizers
D. Barrington (Amherst), N. Nisan (Jerusalem), R. Reischuk (Lübeck), I. Wegener (Dortmund)
For support, please contact
Documents
List of Participants
Dagstuhl-Seminar-Report 172
Seminar Series
- 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)
- 9235: "Complexity and Realization of Boolean Functions" (1992)






