License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemRep.338
URN: urn:nbn:de:0030-drops-152207
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2021/15220/
 

Hastad, Johan ; Krause, Matthias ; Barrington, David A. M. ; Reischuk, Rüdiger
Weitere Beteiligte (Hrsg. etc.): Johan Hastad and Matthias Krause and David A. M. Barrington and Rüdiger Reischuk

Complexity of Boolean Functions (Dagstuhl Seminar 02121)

pdf-format:
DagSemRep-338.pdf (0.9 MB)

BibTeX - Entry

@TechReport{hastad_et_al:DagSemRep.338,
  author =	{Hastad, Johan and Krause, Matthias and Barrington, David A. M. and Reischuk, R\"{u}diger},
  title =	{{Complexity of Boolean Functions (Dagstuhl Seminar 02121)}},
  pages =	{1--25},
  ISSN =	{1619-0203},
  year =	{2002},
  type = 	{Dagstuhl Seminar Report},
  number =	{338},
  institution =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2021/15220},
  URN =		{urn:nbn:de:0030-drops-152207},
  doi =		{10.4230/DagSemRep.338},
}

Collection: Dagstuhl Seminar Reports
Issue Date: 2021
Date of publication: 18.07.2002

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI