On the solution-space geometry of random constraint satisfaction problems

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn 2006, Issue , 2006, Pages 130-139

  Achlioptas, Dimitris ^a   Ricci Tersenghi, Federico ^b  

^a University of California Santa Cruz   (United States)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Random formulas; Satisfiability; Survey Propagation

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; GRAPH THEORY; HEURISTIC METHODS; POLYNOMIALS; PROBLEM SOLVING; RANDOM PROCESSES;

RANDOM CONSTRAINT SATISFACTION PROBLEMS; RANDOM FORMULAS; SATISFIABILITY; SURVEY PROPAGATION;

COMPUTATIONAL GEOMETRY;

EID: 33748117546     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1132516.1132537     Document Type: Conference Paper

References (23)

1. D. Achlioptas, J. Thorpe, manuscript.
2. D. Achlioptas, C. Moore, The asymptotic order of the random k-SAT threshold, In 43rd FOCS, 126-127, 2002.
3. D. Achlioptas, A. Naor, The two possible values of the chromatic number of a random graph, Annals of Mathematics, 162 (3) (2005), 1333-1349.
4. D. Achlioptas, A. Naor, and Y. Peres, Rigorous location of phase transitions in hard optimization problems, Nature, 435, June 9th 2005, 759-764.
5. k In 2 - O(k), Journal of American Mathematical Society, 17 (2004), 947-973.
6. S. Aji, R.J. McEliece, The Generalized Distributive Law, IEEE Trans. Inform. Theory, 46 (2000), 325-343.
7. M. Alekhnovich, E. Ben-Sasson, Linear upper bounds for random walk on small density random 3CNFs, In 44th FOCS, 352-361, 2003.
8. A. Braunstein, R. Zecchina, Survey propagation as local equilibrium equations, J. Stat. Mech., (2004), P06007.
9. M.-T. Chao, J. Franco. Probabilistic analysis of two heuristics for the 3-satisfiability problem, SIAM J. Comput., 15 (4) (1986), 1106-1118.
10. V. Chvátal, B. Reed. Mick gets some (the odds are on his side), In Proc. 33th STOC, 620-627, 1992.
11. O. Dubois and Y. Boufkhad. A general upper bound for the satisfiability threshold of random r-SAT formulae, Journal of Algorithms, 24 (1997), 395-420.
12. O. Dubois, Y. Boufkhad, and J. Mandler. Typical random 3-SAT formulae and the satisfiability threshold, Electronic Colloquium on Computational Complexity, 10 (2003).
13. E. Friedgut, personal communication.
14. A. M. Frieze and S. Suen. Analysis of two simple heuristics on a random instance of k-SAT, Journal of Algorithms, 20 (1996), 312-355.
15. A. Kamath, R. Motwani, K. Palem, and P. Spirakis, Tail bounds for occupancy and the satisfiability threshold conjecture, Rand. Str. & Alg., 7 (1995), 59-80.
16. A. Kaporis, L. M. Kirousis, and E. G. Lalas. The probabilistic analysis of a greedy satisfiability algorithm, In Proc. 10th ESA, 574-585, 2002.
17. A. Kaporis, L. M. Kirousis, and E. G. Lalas. Selecting complementary pairs of literals, In Proc. LICS '03 workshop on Typical Case Complexity and Phase Transitions, 2003.
18. L. M. Kirousis, E. Kranakis, D. Krizanc, and Y. Stamatiou. Approximating the unsatisfiability threshold of random formulas, Rand. Str. & Alg., 12 (1998), 253-269.
19. E. Maneva, E. Mossel, and M. J. Wainwright, A New look at Survey Propagation and its Generalizations, In 16th SODA, 1089-1098, 2005.
20. M. Mézard, T. Mora, and R. Zecchina, Clustering of Solutions in the Random Satisfiability Problem, Phys. Rev. Lett. 94 (2005), 197205. Also, cond-mat/0504070.
21. M. Mézard, T. Mora, and R. Zecchina, Pairs of SAT Assignments and Clustering in Random Boolean Formulae, cond-mat/0506053, June 2nd 2005.
22. M. Mézard, G. Parisi, and R. Zecchina, Analytic and Algorithmic Solution of Random Satisfiability Problems, Science 297 (2002), 812-815.
23. N. C. Wormald, Differential equations for random processes and random graphs, Ann. App. Prob., 5 (1995), 1217-1235.