Complexity classifications for different equivalence and audit problems for Boolean circuits
Computational Complexity
2015-07-01 v5
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.
Cite
@article{arxiv.1009.1208,
title = {Complexity classifications for different equivalence and audit problems for Boolean circuits},
author = {Elmar Böhler and Nadia Creignou and Matthias Galota and Steffen Reith and Henning Schnoor and Heribert Vollmer},
journal= {arXiv preprint arXiv:1009.1208},
year = {2015}
}
Comments
25 pages, 1 figure