Complexity Classifications for Different Equivalence and Audit Problems for Boolean Circuits

Please always quote using this URN: urn:nbn:de:bvb:20-opus-131121
  • We study Boolean circuits as a representation of Boolean functions and conskier different equivalence, audit, and enumeration problems. For a number of restricted sets of gate types (bases) we obtain efficient algorithms, while for all other gate types we show these problems are at least NP-hard.

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar Statistics
Author: Elmar Böhler, Nadia Creignou, Matthias Galota, Steffen Reith, Henning Schnoor, Heribert Vollmer
Document Type:Journal article
Faculties:Fakultät für Mathematik und Informatik / Institut für Informatik
Parent Title (English):Logical Methods in Computer Science
Year of Completion:2012
First Page:1
Last Page:25
Source:Logical Methods in Computer Science Vol. 8(3:27)2012, pp. 1–25. DOI:10.2168/LMCS-8(3:27)2012
Dewey Decimal Classification:0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik
Tag:hierarchy; satisfiability problems
Release Date:2016/12/12
Licence (German):License LogoCC BY-ND: Creative-Commons-Lizenz: Namensnennung, Keine Bearbeitung