Complexity of Boolean Functions (Dagstuhl Seminar 99441)

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



PDF
Thumbnail PDF

File

DagSemRep.257.pdf
  • Filesize: 7.75 MB
  • 30 pages

Document Identifiers

Author Details

D. M. Barrington
Rüdiger Reischuk
Ingo Wegener

Cite AsGet 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
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail