On the satisfiability threshold and clustering of solutions of random 3-SAT formulas.
Elitza N. ManevaAlistair SinclairPublished in: Theor. Comput. Sci. (2008)
Keyphrases
- random sat
- phase transition
- satisfiability problem
- sat problem
- max sat
- combinatorial problems
- random constraint satisfaction problems
- np complete
- boolean satisfiability
- random sat instances
- davis putnam
- search algorithm
- cnf formula
- stochastic local search
- constraint satisfaction
- random instances
- computational complexity
- randomly generated
- sat solvers
- cellular automata
- linear programming
- lower bound
- learning algorithm