Search Results

Abstract

Cite as

Johan Hastad, Matthias Krause, David A. M. Barrington, and Rüdiger Reischuk. Complexity of Boolean Functions (Dagstuhl Seminar 02121). Dagstuhl Seminar Report 338, pp. 1-25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2002)

@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/entities/document/10.4230/DagSemRep.338},
  URN =		{urn:nbn:de:0030-drops-152207},
  doi =		{10.4230/DagSemRep.338},
}

Abstract

Cite as

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)

@TechReport{barrington_et_al:DagSemRep.172,
  author =	{Barrington, David Mix and Nisan, Noam and Reischuk, R\"{u}diger and Wegener, Ingo},
  title =	{{Complexity of Boolean Functions (Dagstuhl Seminar 9711)}},
  pages =	{1--26},
  ISSN =	{1619-0203},
  year =	{1997},
  type = 	{Dagstuhl Seminar Report},
  number =	{172},
  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/entities/document/10.4230/DagSemRep.172},
  URN =		{urn:nbn:de:0030-drops-150594},
  doi =		{10.4230/DagSemRep.172},
}