Elektrobit (Austria)

most citedComplexity classifications for different equivalence and audit problems for Boolean circuits

3 citations

researchers with a paper here

Elmar Böhler1 · h 8
Henning Schnoor1 · h 18
H. Vollmer1 · h 31
Matthias Galota1 · h 4
N. Creignou1 · h 18
S. Reith1 · h 16

collaborating institutions

Aix-Marseille UniversitéFR1 paper
Centre National de la Recherche ScientifiqueFR1 paper
Christian-Albrechts-Universität zu KielDE1 paper
Elektrobit (Finland)FI1 paper
Laboratoire d’Informatique Fondamentale de MarseilleFR1 paper
Leibniz University HannoverDE1 paper
RheinMain University of Applied SciencesDE1 paper
University of WürzburgDE1 paper

1 paper

cs.CC2010★ 3 cited

Complexity classifications for different equivalence and audit problems for Boolean circuits

Elmar BÃ¶hler, Nadia Creignou, Matthias Galota +3

We study Boolean circuits as a representation of Boolean functions and consider different equivalence, audit, and enumeration problems. For a number of restricted sets of gate type…