Exhaustive enumeration unveils clustering and freezing in the random 3-satisfiability problem

John Ardelius and Lenka Zdeborová
Phys. Rev. E 78, 040101(R) – Published 2 October 2008
×

Abstract

We study geometrical properties of the complete set of solutions of the random 3-satisfiability problem. We show that even for moderate system sizes the number of clusters corresponds surprisingly well with the theoretic asymptotic prediction. We locate the freezing transition in the space of solutions, which has been conjectured to be relevant in explaining the onset of computational hardness in random constraint satisfaction problems.

  • Figure
  • Figure
  • Received 4 April 2008

DOI:https://doi.org/10.1103/PhysRevE.78.040101

©2008 American Physical Society

Authors & Affiliations

John Ardelius1,* and Lenka Zdeborová2,3,†

  • 1Swedish Institute of Computer Science SICS, SE-164 24, Kista, Sweden
  • 2Université Paris-Sud, LPTMS, UMR8626, Université Paris-Sud 91405 Orsay cedex, France
  • 3CNRS, LPTMS, UMR8626, Université Paris-Sud 91405 Orsay cedex, France

  • *john@sics.se
  • zdeborov@lptms.u-psud.fr

Article Text

Click to Expand

References

Click to Expand
Issue

Vol. 78, Iss. 4 — October 2008

Reuse & Permissions
Announcement
Physical Review E Scope Description to Include Biological Physics
January 14, 2016

The editors of Physical Review E are pleased to announce that the journal’s stated scope has been expanded to explicitly include the term “Biological Physics.”

Authorization Required


×
×

Images

2 of 2
×

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×