Boolean Circuits as a Data Structure for Boolean Functions: Efficient Algorithms and Hard Problems

Download PDF
Open Webpage

Elmar Böhler, Nadia Creignou, Matthias Galota, Steffen Reith, Henning Schnoor, Heribert Vollmer

Published: 2010, Last Modified: 21 May 2024Log. Methods Comput. Sci. 2010EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: 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 types (bases) we obtain efficient algorithms, while for all other gate types we show these problems are at least NP-hard.