Nondeterministic Direct Product Reductions and the Success Probability of SAT Solvers.
Andrew DruckerPublished in: FOCS (2013)
Keyphrases
- sat solvers
- success probability
- orders of magnitude
- sat solving
- propositional satisfiability
- max sat
- search strategies
- search space
- boolean satisfiability
- constraint satisfaction
- search tree
- expected cost
- sat instances
- sat problem
- weighted max sat
- clause learning sat solvers
- boolean formula
- computational complexity
- clause learning
- satisfiability problem
- constraint programming
- evolutionary algorithm