TY  - JOUR
A1  - Böhler, Elmar
A1  - Creignou, Nadia
A1  - Galota, Matthias
A1  - Reith, Steffen
A1  - Schnoor, Henning
A1  - Vollmer, Heribert
T1  - Complexity Classifications for Different Equivalence and Audit Problems for Boolean Circuits
T2  - Logical Methods in Computer Science
N2  - 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.
KW  - hierarchy
KW  - satisfiability problems
Y1  - 2012
UR  - https://opus.bibliothek.uni-wuerzburg.de/frontdoor/index/index/docId/13112
UR  - https://nbn-resolving.org/urn:nbn:de:bvb:20-opus-131121
VL  - 8
IS  - 3:27
SP  - 1
EP  - 25
ER  -