Clustering of Solutions in the Random Satisfiability Problem

M. Mézard, T. Mora, and R. Zecchina
Phys. Rev. Lett. 94, 197205 – Published 19 May 2005
×

Abstract

Using elementary rigorous methods we prove the existence of a clustered phase in the random K-SAT problem, for K8. 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.

  • Figure
  • Received 18 February 2005

DOI:https://doi.org/10.1103/PhysRevLett.94.197205

©2005 American Physical Society

Authors & Affiliations

M. Mézard1, T. Mora1, and R. Zecchina2

  • 1Laboratoire de Physique Théorique et Modèles Statistiques, bâtiment 100, Université Paris-Sud, F-91405 Orsay, France.
  • 2Abdus Salam International Center for Theoretical Physics, Strada Costiera 11, 34100 Trieste, Italy

Article Text

Click to Expand

References

Click to Expand
Issue

Vol. 94, Iss. 19 — 20 May 2005

Reuse & Permissions
Collection
Scanning Probe Microscopy: From Sublime to Ubiquitous
May 4, 2016

This collection marks the 35th anniversary of scanning tunneling microscopy (STM) and the 30th anniversary of atomic force microscopy (AFM). These papers, all published in the Physical Review journals, highlight the positive impact that STM and AFM have had, and continue to have, on physical science research. The papers included in the collection have been made free to read.

Authorization Required


×
×

Images

1 of 1
×

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×