arXiv · cond-mat/0504070
Clustering of solutions in the random satisfiability problem
Abstract
Using elementary rigorous methods we prove the existence of a clustered phase in the random $K$-SAT problem, for $K\geq 8$. In this phase the solutions are grouped into clusters which are far away from each other. The results are in agreement with previous predictions of the cavity method and give a rigorous confirmation to one of its main building blocks. It can be generalized to other systems of both physical and computational interest.
Explore related subjects
Keep this discovery
M. Mezard, T. Mora, R. Zecchina. 2005-04-04. Clustering of solutions in the random satisfiability problem. https://doi.org/10.1103/physrevlett.94.197205
Cite the original work for its findings. Save a collection to share your selection of sources.