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.257
URN: urn:nbn:de:0030-drops-151420
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2021/15142/
 

Barrington, D. M. ; Reischuk, Rüdiger ; Wegener, Ingo
Weitere Beteiligte (Hrsg. etc.): D. M. Barrington and Rüdiger Reischuk and Ingo Wegener

Complexity of Boolean Functions (Dagstuhl Seminar 99441)

pdf-format:
DagSemRep-257.pdf (8 MB)

BibTeX - Entry

@TechReport{barrington_et_al:DagSemRep.257,
  author =	{Barrington, D. M. and Reischuk, R\"{u}diger and Wegener, Ingo},
  title =	{{Complexity of Boolean Functions (Dagstuhl Seminar 99441)}},
  pages =	{1--30},
  ISSN =	{1619-0203},
  year =	{2000},
  type = 	{Dagstuhl Seminar Report},
  number =	{257},
  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/15142},
  URN =		{urn:nbn:de:0030-drops-151420},
  doi =		{10.4230/DagSemRep.257},
}

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

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