Hiding Quiet Solutions in Random Constraint Satisfaction Problems

Florent Krzakala and Lenka Zdeborová
Phys. Rev. Lett. 102, 238701 – Published 8 June 2009

Abstract

We study constraint satisfaction problems on the so-called planted random ensemble. We show that for a certain class of problems, e.g., graph coloring, many of the properties of the usual random ensemble are quantitatively identical in the planted random ensemble. We study the structural phase transitions and the easy-hard-easy pattern in the average computational complexity. We also discuss the finite temperature phase diagram, finding a close connection with the liquid-glass-solid phenomenology.

  • Figure
  • Figure
  • Figure
  • Received 16 January 2009

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

©2009 American Physical Society

Authors & Affiliations

Florent Krzakala1,2 and Lenka Zdeborová2

  • 1CNRS and ESPCI ParisTech, 10 rue Vauquelin, UMR 7083 Gulliver, Paris 75000 France
  • 2Theoretical Division and Center for Nonlinear Studies, Los Alamos National Laboratory, Los Alamos, New Mexico 87545 USA

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 102, Iss. 23 — 12 June 2009

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review Letters

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×