Complexity of Boolean Functions (Dagstuhl Seminar 9711)

Barrington, David Mix; Nisan, Noam; Reischuk, Rüdiger; Wegener, Ingo

doi:10.4230/DagSemRep.172

Document

Complexity of Boolean Functions (Dagstuhl Seminar 9711)

Authors David Mix Barrington, Noam Nisan, Rüdiger Reischuk, Ingo Wegener

Part of: Volume: Dagstuhl Seminar Reports (DagSemRep)
Part of: Series: Dagstuhl Seminar Reports (DagSemRep)
License: Creative Commons Attribution 4.0 International license
Publication Date: 1997-06-10

PDF

File

DagSemRep.172.pdf

Filesize: 270 kB
26 pages

Document Identifiers

DOI: 10.4230/DagSemRep.172
URN: urn:nbn:de:0030-drops-150594

Author Details

David Mix Barrington

Noam Nisan

Rüdiger Reischuk

Ingo Wegener

Cite As Get BibTex

David Mix Barrington, Noam Nisan, Rüdiger Reischuk, and Ingo Wegener. Complexity of Boolean Functions (Dagstuhl Seminar 9711). Dagstuhl Seminar Report 172, pp. 1-26, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (1997) https://doi.org/10.4230/DagSemRep.172

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail