Constraint satisfaction problems with isolated solutions are hard

  title={Constraint satisfaction problems with isolated solutions are hard},
  author={Lenka Zdeborov{\'a} and Marc M{\'e}zard},
We study the phase diagram and the algorithmic hardness of the random ‘locked’ constraint satisfaction problems, and compare them to the commonly studied ‘non-locked’ problems like satisfiability of Boolean formulae or graph coloring. The special property of the locked problems is that clusters of solutions are isolated points. This simplifies significantly the determination of the phase diagram, which makes the locked problems particularly appealing from the mathematical point of view. On the… CONTINUE READING
10 Citations
5 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 10 extracted citations


Publications referenced by this paper.
Showing 1-5 of 5 references

Information, Physics, Computation: Probabilistic approaches (Cambridge: Cambridge University Press) in preparation

  • M Mézard, A Montanari
  • 2008
Highly Influential
4 Excerpts

Constraint satisfaction problems with isolated solutions are hard

  • A Braunstein, R Zecchina
  • Phys. Rev. Lett
  • 2006
1 Excerpt

SODA ’ 01 : Proc . 12 th Annual ACMSIAM Symp

  • D Achlioptas, A Chtcherba, G Istrate, C Moore
  • 2001

Spin-Glass Theory and Beyond (Lecture Notes in Physics vol 9) (Singapore: World Scientific

  • M Mézard, G Parisi, M AVirasoro
  • 1987
2 Excerpts

Similar Papers

Loading similar papers…