Search Results

---

Abstract

---

Cite as

Rüdiger Reischuk and Dietmar Uhlig. Complexity and Realization of Boolean Functions (Dagstuhl Seminar 9235). Dagstuhl Seminar Report 45, pp. 1-28, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (1992)

---

Copy BibTex To Clipboard

@TechReport{reischuk_et_al:DagSemRep.45,
  author =	{Reischuk, R\"{u}diger and Uhlig, Dietmar},
  title =	{{Complexity and Realization of Boolean Functions (Dagstuhl Seminar 9235)}},
  pages =	{1--28},
  ISSN =	{1619-0203},
  year =	{1992},
  type = 	{Dagstuhl Seminar Report},
  number =	{45},
  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.45},
  URN =		{urn:nbn:de:0030-drops-149332},
  doi =		{10.4230/DagSemRep.45},
}

@TechReport{reischuk_et_al:DagSemRep.45, author = {Reischuk, R\"{u}diger and Uhlig, Dietmar}, title = {{Complexity and Realization of Boolean Functions (Dagstuhl Seminar 9235)}}, pages = {1--28}, ISSN = {1619-0203}, year = {1992}, type = {Dagstuhl Seminar Report}, number = {45}, 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.45}, URN = {urn:nbn:de:0030-drops-149332}, doi = {10.4230/DagSemRep.45}, }