Walksat Stalls Well Below Satisfiability.
Amin Coja-OghlanAmir HaqshenasSamuel HetterichPublished in: SIAM J. Discret. Math. (2017)
Keyphrases
- satisfiability problem
- stochastic local search
- sat problem
- np complete
- phase transition
- search algorithm
- temporal logic
- random sat
- boolean satisfiability
- max sat
- sat solvers
- computational complexity
- sat instances
- davis putnam
- stochastic local search algorithms
- belief revision
- constraint satisfaction
- data sets
- conjunctive normal form
- sat solving