Solving constraint satisfaction problems through belief propagation-guided decimation

45th Annual Allerton Conference on Communication, Control, and Computing 2007

Volumn 1, Issue , 2007, Pages 352-359

  Montanari, Andrea ^a   Ricci Tersenghi, Federico ^b   Semerjian, Guilhem ^c  

^a STANFORD UNIVERSITY   (United States)

^b UNIVERSITÀ DI ROMA LA SAPIENZA   (Italy)

^c LABORATOIRE DE PHYSIQUE STATISTIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; MESSAGE PASSING;

BELIEF PROPAGATION; BELIEF PROPAGATION GUIDED DECIMATIONS; HARD CONSTRAINTS; MESSAGE PASSING ALGORITHM; RANDOM GRAPHS; SATISFIABILITY; STATISTICAL PHYSICS; TREE MODELING;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84890888657     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (33)

1. N. Creignou, S. Khanna and M. Sudan, Complexity classifications of boolean constraint satisfaction problems, SIAM, Philadelphia, 2001
2. F. R. Kschischang, B. J. Frey and H-A. Loeliger, "Factor graphs and the sum-product algorithm" (2001), IEEE Trans. Inform. Theory 47, 498-519.
3. B. Selman, H. Levesque and D. Mitchell, "A New Method for Solving Hard Satisfiability Problems", 10th Natl Conf. on Artif. Intell., San Jose, CA, 440-446
4. J. Franco, "Results related to threshold phenomena research in satisfiability: lower bounds", Theoret. Comput. Sci. 265, 147-157 (2001).
5. d. Achlioptas and g. b. Sorkin, Proc. of the Annual Symposium on the Foundations of Computer Science, Redondo Beach, CA, 2000
6. M. Mézard, g. Parisi, and r. Zecchina, "Analytic and Algorithmic Solution of Random Satisfiability Problems", Science 297 (2002), 812.
7. M. Mézard and R. Zecchina, "The random K-satisfiability problem: from an analytic solution to an efficient algorithm", Phys. Rev. E 66 (2002), 056126.
8. F. Krzakala, A. Montanari, F. Ricci-Tersenghi, G. Semerjian and L. Zdeborova, "Gibbs States and the Set of Solutions of Random Constraint Satisfaction Problems," Proc. Natl. Acad. Sci. 104 (2007) 10318-10323.
9. M. Luby, M. Mitzenmacher and A. Shokrollahi, "Analysis of Random Processes via And-Or Tree Evaluation" Proc. of the Symposium on Discrete Algorithms, San Francisco, 2008.
10. S. Janson, T. Luczak and A. Rucihski", Random graphs, John Wiley, New York, 2000
11. D. Achlioptas and Y Peres, "The threshold for random κ-SAT is 2κ log2-O(κ)" Journal of the AMS, 17 (2004), 947-973.
12. S. Mertens, M. Mézard and R. Zecchina, "Threshold values of random K-SAT from the cavity method", Rand. Struct. Alg. 28, 340-373 (2006).
13. S. J. Pumphrey, "Solving the Satisfiability Problem Using Message Passing Techniques," Cambridge Physics Project Report.
14. T. Richardson and R. Urbanke, Modern Coding Theory, draft available at http://lthcwww.epf1.ch/mct/index.php
15. G. Biroli, R. Monasson and M. Weigt, "A variational description of the ground state structure in random satisfiability problems", Eur. Phys. J. B 14, 551 (2000).
16. A. Montanari and D. Shah, "Counting good truth assignments of random k-SAT formulae," Proc. of the Symposium on Discrete Algorithms, New Orleans, 2007.
17. E. Aureli, U. Gordon and S. Kirkpatrick, Proc. of Neural Information Processing Symposium, Vancouver, 2004.
18. E. N. Maneva, E. Mossel and M. J. Wainwright, Proc. of the Symposium on Discrete Algorithms, Vancouver, 2005.
19. S. Tatikonda and M. Jordan, "Loopy Belief Propagation and Gibbs Measures", Proc. Uncertainty in Artificial Ititeli. 18 (2002) 493-500.
20. D. Gamarnik and A. Bandyopadhyay, Proc. of the Symposium on Discrete Algorithms, Miami, (2006).
21. U. Feige, E. Mossel and D. Vilenchik, "Complete convergence of message passing algorithms for some satisfiability problems" Proc. RANDOM, Barcelona, (2006).
22. A. Coja-Oghlan, M. Krivelevich and D. Vilenchik, "Why almost all A;-CNF formulas are easy", Proceedings of the 13th International Conference on Analysis of Algorithms, to appear, (2007).
23. F. Altarelli, R. Monasson and F. Zamponi, "Can rare SAT formulae be easily recognized? On the efficiency of message-passing algorithms for K-SAT at large clause-to-variable ratios", J. Phys. A: Math. Theor. 40, 867-886 (2007).
24. C. Measson, A. Montanari, T. Richardson and R. Urbanke, "Life Above Threshold: From List Decoding to Area Theorem and MSE," IEEE Inform. Theory Workshop, San Antonio, 2004
25. C. Measson, A. Montanari and R. Urbanke, "Maxwell Construction: The Hidden Bridge between Iterative and Maximum a Posteriori Decoding," IEEE Trans. Inform. Theory, to be published.
26. E. Maneva and M. Wainwright, "Lossy source encoding via message-passing and decimation over generalized codewords of LDGM codes," IEEE Inform. Theory Symposium, Adelaide, 2004
27. S. Ciliberti, M. Mézard and R. Zecchina, "Lossy data compression with random gates," Phys. Rev. Lett. 95, 038701 (2005)
28. J. Pearl, "Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference", San Francisco, CA: Morgan Kaufmann, 1988.
29. A. Braunstein, M. Mézard and R. Zecchina, "Survey propagation: an algorithm for satisfiability", Rand. Struct, and Algorithms 27, 201-226 (2005).
30. D. Aldous and J.M. Steele, "The objective method", in Probability on Discrete Structures, H. Kesten ed., 1, Springer (2003).
31. A. Gerschenfeld and A. Montanari, Proc. of the Annual Symposium on the Foundations of Computer Science, Providence, RI, 2007
32. G. Semerjian, "On the freezing of variables in random constraint satisfaction problems", arXiv/0705.2147.
33. A. Frieze and S. Suen, "Analysis of Two Simple Heuristics on a Random Instance of k-SAT", Journal of Alg. 20, 312-355 (1996).