Boolean Circuits as a Data Structure for Boolean Functions: Efficient Algorithms and Hard Problems
Elmar BöhlerNadia CreignouMatthias GalotaSteffen ReithHenning SchnoorHeribert VollmerPublished in: Log. Methods Comput. Sci. (2010)
Keyphrases
- boolean functions
- hard problems
- data structure
- truth table
- uniform distribution
- threshold functions
- randomly generated
- multi valued
- logic synthesis
- prime implicants
- phase transition
- linear threshold
- functional properties
- membership queries
- dnf formulas
- digital circuits
- random instances
- polynomial size
- disjunctive normal form
- power dissipation
- hyper heuristics