An improvement on the complexity of factoring read-once Boolean functions.
Martin Charles GolumbicAviad MintzUdi RoticsPublished in: Discret. Appl. Math. (2008)
Keyphrases
- boolean functions
- read once formulas
- uniform distribution
- membership queries
- randomly generated
- polynomial size
- dnf formulas
- dnf formulae
- threshold functions
- relevant variables
- functional properties
- worst case
- multi valued
- equivalence queries
- disjunctive normal form
- prime implicants
- boolean formula
- binary decision diagrams
- computational complexity
- linear functions
- bounded treewidth
- search algorithm
- logic programs
- lower bound
- monotone dnf