Projective cofactor decompositions of Boolean functions and the satisfiability problem.
Madhav DesaiVirendra SulePublished in: CoRR (2016)
Keyphrases
- boolean functions
- satisfiability problem
- np complete
- temporal logic
- search algorithm
- uniform distribution
- randomly generated
- sat problem
- phase transition
- stochastic local search
- membership queries
- functional properties
- threshold functions
- stochastic local search algorithms
- max sat
- binary decision diagrams
- pspace complete
- sat instances
- dnf formulae
- linear threshold
- multi valued
- polynomial size
- conjunctive normal form
- decomposition methods