Clustering of solutions in the random satisfiability problem
Marc MézardThierry MoraRiccardo ZecchinaPublished in: CoRR (2005)
Keyphrases
- satisfiability problem
- stochastic local search algorithms
- np complete
- phase transition
- search algorithm
- temporal logic
- clustering algorithm
- sat problem
- pspace complete
- graph coloring problems
- k means
- solving hard
- sat instances
- random instances
- randomly generated
- decision procedures
- optimal solution
- max sat
- stochastic local search
- random sat
- genetic algorithm