Complexity of Boolean Functions (Dagstuhl Seminar 99441)

Barrington, D. M.; Reischuk, Rüdiger; Wegener, Ingo

doi:10.4230/DagSemRep.257

Document

Complexity of Boolean Functions (Dagstuhl Seminar 99441)

Authors D. M. Barrington, 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: 2000-02-07

PDF

File

DagSemRep.257.pdf

Filesize: 7.75 MB
30 pages

Document Identifiers

DOI: 10.4230/DagSemRep.257
URN: urn:nbn:de:0030-drops-151420

Author Details

D. M. Barrington

Rüdiger Reischuk

Ingo Wegener

Cite As Get BibTex

D. M. Barrington, Rüdiger Reischuk, and Ingo Wegener. Complexity of Boolean Functions (Dagstuhl Seminar 99441). Dagstuhl Seminar Report 257, pp. 1-30, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2000) https://doi.org/10.4230/DagSemRep.257

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