2000 character limit reached
Complexity classifications for different equivalence and audit problems for Boolean circuits
Published 7 Sep 2010 in cs.CC | (1009.1208v5)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.