On the Satisfiability Threshold and Clustering of Solutions of Random 3-SAT Formulas
Elitza N. ManevaAlistair SinclairPublished in: CoRR (2007)
Keyphrases
- random sat
- phase transition
- satisfiability problem
- sat problem
- max sat
- random constraint satisfaction problems
- combinatorial problems
- boolean satisfiability
- np complete
- random instances
- stochastic local search
- temporal logic
- random sat instances
- sat instances
- davis putnam
- randomly generated
- optimal solution
- learning algorithm
- sat solvers
- search strategies
- search algorithm
- graph coloring
- symmetry breaking