License
When quoting this document, please refer to the following
DOI: 10.4230/DagSemRep.45
URN: urn:nbn:de:0030-drops-149332
URL: https://drops.dagstuhl.de/opus/volltexte/2021/14933/
 


Reischuk, Rüdiger ; Uhlig, Dietmar
Weitere Beteiligte (Hrsg. etc.): Rüdiger Reischuk and Dietmar Uhlig

Complexity and Realization of Boolean Functions (Dagstuhl Seminar 9235)

pdf-format:
DagSemRep-45.pdf (5 MB)


BibTeX - Entry

@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/opus/volltexte/2021/14933},
  URN =		{urn:nbn:de:0030-drops-149332},
  doi =		{10.4230/DagSemRep.45},
}

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


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