On the solution-space geometry of random constraint satisfaction problems

Random Structures and Algorithms

Volumn 38, Issue 3, 2011, Pages 251-268

  Achlioptas, Dimitris ^a,b   Coja Oghlan, Amin ^c   Ricci Tersenghi, Federico ^d  

^a University of California   (United States)

^b Univ of Patras   (Greece)

^c UNIVERSITY OF WARWICK   (United Kingdom)

^d SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Computational complexity; k SAT; Random formulas; Satisfiability; Statistical mechanics

Indexed keywords

EID: 79953018930     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20323     Document Type: Article

References (19)

1. D. Achlioptas, A. Coja-Oghlan, Algorithmic barriers from phase transitions, In Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS'08), Philadelphia, PA, 2008, pp. 793-802.
2. D. Achlioptas, C. Moore, The asymptotic order of the random k-SAT threshold, In Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS'02), Vancouver, BC, Canada, 2002, pp. 126-127.
3. D. Achlioptas, A. Naor, Y. Peres, Rigorous location of phase transitions in hard optimization problems, Nature 435 (2005), 759-764.
4. k ln 2 - O(k), J Am Math Soc 17 (2004), 947-973.
5. D. Achlioptas, F. Ricci-Tersenghi, Random formulas have frozen variables, SIAM J Comput 39 (2009), 260-280.
6. J. Ardelius, L. Zdeborova, Exhaustive enumeration unveils clustering and freezing in random 3-SAT, Phys Rev E 78 (2008), 040101(R).
7. O. Dubois, Y. Boufkhad, A general upper bound for the satisfiability threshold of random r-SAT formulae, J Algorithms 24 (1997), 395-420.
8. O. Dubois, Y. Boufkhad, J. Mandler, Typical random 3-SAT formulae and the satisfiablity threshold, Electro Colloq Comput Complex 10 (2003).
9. P. Erds, M. Simonovits, Supersaturated graphs and hypergraphs, Combinatorica 7 (1987), 35-38.
10. E. Friedgut, Sharp thresholds of graph proprties, and the k-SAT problem, J Amer Math Soc 12 (1999), 1017-1054.
11. E. Friedgut, Hunting for sharp thresholds, Random Struct Algorithms 26 (2005), 37-51.
12. A. M. Frieze, S. Suen, Analysis of two simple heuristics on a random instance of k-SAT, J Algorithms 20 (1996), 312-355.
13. A. C. Kaporis, L. M. Kirousis, E. G. Lalas, Selecting complementary pairs of literals, Electron Notes Discrete Math 16 (2003), 47-70.
14. L. M. Kirousis, E. Kranakis, D. Krizanc, Y. Stamatiou, Approximating the unsatisfiability threshold of random formulas, Random Struct Algorithms 12 (1998), 253-269.
15. F. Krzakala, A. Montanari, F. Ricci-Tersenghi, G. Semerjian, L. Zdeborova, Gibbs states and the set of solutions of random constraint satisfaction problems, Proc Natl Acad Sci USA 104 (2007), 10318-10323.
16. M. Mézard, T. Mora, R. Zecchina, Clustering of solutions in the random satisfiability problem, Phys Rev Lett 94 (2005), 197205.
17. H. Daudé, M. Mezard, T. Mora, R. Zecchina, Pairs of SAT assignment in random Boolean formulae, Theoretical Computer Science 393 (2008), 260-279.
18. M. Mézard, G. Parisi, R. Zecchina, Analytic and algorithmic solution of random satisfiability problems, Science 297 (2002), 812-815.
19. R. E. A. C. Paley, A. Zygmund, A note on analytic functions in the unit circle, Proc Camb Phil Soc 28 (1932), 266-272.