Finding Small Backdoors in SAT Instances.
Zijie LiPeter van BeekPublished in: Canadian Conference on AI (2011)
Keyphrases
- sat instances
- satisfiability problem
- sat solvers
- randomly generated
- sat problem
- stochastic local search
- computational properties
- phase transition
- np complete
- data structure
- search tree
- expressive power
- random sat instances
- random instances
- boolean satisfiability
- max sat
- branch and bound algorithm
- branch and bound
- constraint satisfaction
- search space
- search algorithm