Locality and Hard SAT-Instances.
Klas MarkströmPublished in: J. Satisf. Boolean Model. Comput. (2006)
Keyphrases
- sat instances
- random instances
- sat solvers
- randomly generated
- satisfiability problem
- phase transition
- random sat
- sat problem
- computational properties
- boolean satisfiability
- random sat instances
- hard problems
- propositional satisfiability
- constraint satisfaction problems
- stochastic local search
- constraint satisfaction
- orders of magnitude
- np complete
- artificial intelligence
- search tree
- max sat
- special case
- lower bound
- database