3-SAT Faster and Simpler - Unique-SAT Bounds for PPSZ Hold in General.
Timon HertliPublished in: FOCS (2011)
Keyphrases
- sat solvers
- special case
- satisfiability problem
- sat solving
- phase transition
- propositional satisfiability
- search algorithm
- stochastic local search
- closely related
- search strategies
- sat problem
- learning algorithm
- upper bound
- lower bound
- orders of magnitude
- np complete
- worst case
- max sat
- objective function
- boolean satisfiability
- sat encodings
- data sets
- stochastic local search algorithms