Boolean Circuits as Representation for Boolean Functions: Efficient Algorithms and Hard Problems

Details Boolean Circuits as Representation for Boolean Functions: Efficient Algorithms and Hard Problems Boolean Circuits as Representation for Boolean Functions: Efficient Algorithms and Hard Problems

2010-09-07

arxiv.org/abs/1009.1208v2

Computer Science

Computational Complexity

27 pages, 1 figure

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Boolean Circuits as Representation for Boolean Functions: Efficient Algorithms and Hard Problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Boolean Circuits as Representation for Boolean Functions: Efficient Algorithms and Hard Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Boolean Circuits as Representation for Boolean Functions: Efficient Algorithms and Hard Problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-704460