3-SAT Faster and Simpler - Unique-SAT Bounds for PPSZ Hold in General.
Timon HertliPublished in: SIAM J. Comput. (2014)
Keyphrases
- satisfiability problem
- sat solvers
- special case
- search algorithm
- pseudo boolean constraints
- stochastic local search
- sat solving
- stochastic local search algorithms
- sat problem
- propositional satisfiability
- sat instances
- logic programming
- phase transition
- closely related
- upper bound
- upper and lower bounds
- learning algorithm
- search procedures
- np complete
- boolean formula
- boolean satisfiability
- sat encodings
- tractable classes
- lower bound
- modulo theories