Quiet planting in the locked constraint satisfaction problems

SIAM Journal on Discrete Mathematics

Volumn 25, Issue 2, 2011, Pages 750-770

  Zdeborová, Lenka ^a   Krzakala, Florent ^a,b  

^a LOS ALAMOS NATIONAL LABORATORY   (United States)

^b CNRS   (France)

Author keywords

Belief propagation; Constraint satisfaction problems; Instances with a unique satisfying assignment; Planted random ensemble; Reconstruction on trees

Indexed keywords

BELIEF PROPAGATION; CAVITY METHOD; CONSTRAINT SATISFACTION PROBLEMS; HIGH PROBABILITY; INSTANCES WITH A UNIQUE SATISFYING ASSIGNMENT; PLANTED RANDOM ENSEMBLE; SATISFYING ASSIGNMENTS; SECOND MOMENTS;

PLANT EXTRACTS;

EID: 79960615509     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/090750755     Document Type: Article

References (43)

1. D. ACHLIOPTAS, A. CHTCHERBA, G. ISTRATE, AND C. MOORE, The phase transition in 1-in-k SAT and NAE 3-SAT, in Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, PA, 2001, pp. 721-722.
2. D. ACHLIOPTAS AND A. COJA-OGHLAN, Algorithmic barriers from phase transitions, arXiv:0803.2122v2, 2008.
3. S. BEN-SHIMON AND D. VILENCHIK, Message passing for the coloring problem: Gallager meets Alon and Kahale, in Proceedings of the 13th International Conference on Analysis of Algorithms, Discrete Math. Theor. Comput. Sci. Proceedings, Assoc. Discrete Math. Theor. Comput. Sci., Nancy, 2007, pp. 217-226.
4. G. BIROLI AND M. MÉZARD, Lattice glass models, Phys. Rev. Lett., 88 (2002), Article 025501.
5. P. CHEESEMAN, B. KANEFSKY, AND W. M. TAYLOR, Where the really hard problems are, in Proceedings of the 12th International Joint Conference on Artificial Intelligence, Sydney, Australia, Morgan Kaufmann, San Mateo, CA, 1991, pp. 331-337.
6. V. CHVATAL AND E. SZEMERDI, Many hard examples for resolution, J. ACM, 35 (1988), pp. 759-768.
7. A. COJA-OGHLAN, M. KRIVELEVICH, AND D. VILENCHIK, Why almost all k-colorable graphs are easy to color, in 24th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci. 4393, Springer, Berlin, 2007, pp. 121-132.
8. A. COJA-OGHLAN, E. MOSSEL, AND D. VILENCHIK, A spectral approach to analyzing belief propagation for 3-coloring, Comb. Probab. Comput., 18 (2009), pp. 881-912.
9. J. R. L. DE, Almeida AND D. J. THOULESS, Stability of the Sherrington-Kirkpatrick solution of a spin-glass model, J. Phys. A, 11 (1978), pp. 983-990.
10. W. EVANS, C. KENYON, Y. PERES, AND L. J. SCHULMAN, Broadcasting on trees and the Ising model, Ann. Appl. Probab., 10 (2000), pp. 410-433.
11. R. MONASSON, F. ALTARELLI, AND F. ZAMPONI, Can rare SAT formulas be easily recognized? On the efficiency of message passing algorithms for k-SAT at large clause-to-variable ratios, J. Phys. A, 40 (2007), pp. 867-886.
12. E. FARHI, J. GOLDSTONE, S. GUTMANN, J. LAPAN, A. LUNDGREN, AND D. PREDA, A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem, Science, 292 (2001), pp. 472-475.
13. U. FEIGE, E. MOSSEL, AND D. VILENCHIK, Complete convergence of message passing algorithms for some satisfiability problems, in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Lecture Notes in Comput. Sci. 4110, Springer, Berlin, 2006, p. 339-350. (Pubitemid 44577543)
14. R. G. GALLAGER, Low-density parity check codes, IEEE Trans. Inform. Theory, 8 (1962), pp. 21-28.
15. R. G. GALLAGER, Information Theory and Reliable Communication, John Wiley, New York, 1968.
16. S. JANSON AND E. MOSSEL, Robust reconstruction on trees is determined by the second eigenvalue, Ann. Probab., 32 (2004), pp. 2630-2649. (Pubitemid 39258783)
17. T. JOERG, F. KRZAKALA, J. KURCHAN, AND A. C. MAGGS, Simple glass models and their quantum annealing, Phys. Rev. Lett., 101 (2008), Article 147204.
18. R. J. BAYARDO, Jr AND J. D. PEHOUSEK, Counting models using connected components, in Proceedings of th 17th National Conference on Artificial Intelligence, Austin, TX, AAAI Press, 2000, pp. 157-162.
19. H. KESTEN AND B. P. STIGUM, Additional limit theorems for indecomposable multidimensional Galton- Watson processes, Ann. Math. Stat., 37 (1966), pp. 1463-1481.
20. H. KESTEN AND B. P. STIGUM, Limit theorems for decomposable multi-dimensional galton-watson processes, J. Math. Anal. Appl., 17 (1966), pp. 309-338.
21. M. KRIVELEVICH AND D. VILENCHIK, Semi-random models as benchmarks for coloring algorithms, in 2006 Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics (ANALCO), Miami, FL, SIAM, 2006, pp. 211-221. (Pubitemid 43774934)
22. F. KRZAKALA, A. MONTANARI, F. RICCI-TERSENGHI, G. SEMERJIAN, AND L. ZDEBOROVÁ, Gibbs states and the set of solutions of random constraint satisfaction problems, Proc. Natl. Acad. Sci. USA, 104 (2007), pp. 10318-10323. (Pubitemid 47185663)
23. F. KRZAKALA, M. TARZIA, AND L. ZDEBOROVÁ, A lattice model for colloidal gels and glasses, Phys. Rev. Lett., 101 (2008), Article 165702.
24. F. KRZAKALA AND L. ZDEBOROVÁ, Hiding quiet solutions in random constraint satisfaction problems, Phys. Rev. Lett., 102 (2009), Article 238701.
25. F. R. KSCHISCHANG, B. FREY, AND H.-A. LOELIGER, Factor graphs and the sum-product algorithm, IEEE Trans. Inform. Theory, 47 (2001), pp. 498-519. (Pubitemid 32318087)
26. M. MÉZARD AND A. MONTANARI, Reconstruction on trees and spin glass transition, J. Stat. Phys., 124 (2006), pp. 1317-1350. (Pubitemid 44581231)
27. M. MÉZARD AND A. MONTANARI, Information, Physics, Computation, Oxford University Press, Oxford, 2009.
28. M. MÉZARD AND G. PARISI, The Bethe lattice spin glass revisited, Eur. Phys. J. B, 20 (2001), pp. 217-233. (Pubitemid 33626617)
29. M. MÉZARD, G. PARISI, AND M. A. VIRASORO, Spin-Glass Theory and Beyond, Lecture Notes in Phys. 9, Springer, Berlin, 1987.
30. M. MÉZARD, G. PARISI, AND R. ZECCHINA, Analytic and algorithmic solution of random satisfiability problems, Science, 297 (2002), pp. 812-815. (Pubitemid 34839626)
31. D. G. MITCHELL, B. SELMAN, AND H. J. LEVESQUE, Hard and easy distributions for SAT problems, in Proceedings of the 10th National Conference on Artificial Intelligence, San Jose, CA, AAAI Press, 1992, pp. 459-465. (Pubitemid 23633548)
32. A. MONTANARI AND G. SEMERJIAN, On the dynamics of the glass transition on Bethe lattices, J. Stat. Phys., 124 (2006), pp. 103-189. (Pubitemid 44313709)
33. T. MORA, Géométrie et inférence dans l'optimisation et en théorie de l'information, Ph.D. thesis, Université Paris-Sud, Orsay, France 2007; also available online from http://tel.archives- ouvertes.fr/tel-00175221/en/.
34. E. MOSSEL, Reconstruction on trees: Beating the second eigenvalue, Ann. Appl. Probab., 11 (2001), pp. 285-300.
35. J. PEARL, Reverend Bayes on inference engines: A distributed hierarchical approach, in Proceedings of the 2nd National Conference on Artificial Intelligence, Pittsburgh, PA, AAAI Press, 1982, pp. 133-136. (Pubitemid 13512137)
36. O. RIVOIRE, The cavity method for large deviations, J. Stat. Mech. Theory Exp. (2005), Article P07004.
37. S. SEITZ, M. ALAVA, AND P. ORPONEN, Focused local search for random 3-satisfiability, J. Stat. Mech. Theory Exp. (2005), Article P06006.
38. B. SELMAN, H. A. KAUTZ, AND B. COHEN, Local search strategies for satisfiability testing, in Cliques, Coloring, and Satisfiability, DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 26, D. S. Johnson and M. A. Trick, eds., Amer. Math. Soc., Providence, RI, 1996, pp. 521-532.
39. M. SIPSER AND D. A. SPIELMAN, Expander codes, IEEE Trans. Inform. Theory, 42 (1996), pp. 1710-1722. (Pubitemid 126769170)
40. A. P. YOUNG, S. KNYSH, AND V. N. SMELYANSKIY, Size dependence of the minimum excitation gap in the quantum adiabatic algorithm, Phys. Rev. Lett., 101 (2008), Article 170503.
41. L. ZDEBOROVÁ AND F. KRZAKALA, Phase transitions in the coloring of random graphs, Phys. Rev. E, 76 (2007), Article 031131.
42. L. ZDEBOROVÁ AND M. MÉZARD, Constraint satisfaction problems with isolated solutions are hard, J. Stat. Mech. Theory Exp., (2008), Article P12004.
43. L. ZDEBOROVÁ AND M. MÉZARD, Locked constraint satisfaction problems, Phys. Rev. Lett., 101 (2008), Article 078702.