Pairs of SAT-assignments in random Boolean formulæ

Theoretical Computer Science

Volumn 393, Issue 1-3, 2008, Pages 260-279

  Daudé, Hervé ^a   Mézard, Marc ^b   Mora, Thierry ^b   Zecchina, Riccardo ^c  

^a AIX MARSEILLE UNIVERSITÉ   (France)

^b UNIVERSITÉ PARIS SUD   (France)

^c POLITECNICO DI TORINO   (Italy)

Author keywords

Clustering; Satisfiability

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL GEOMETRY; COMPUTATIONAL MECHANICS; HEURISTIC ALGORITHMS; PROBLEM SOLVING;

CLAUSE DENSITY; HAMMING DISTANCES;

RANDOM PROCESSES;

EID: 39649115183     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.01.005     Document Type: Article

References (38)

1. Stephen Cook, The complexity of theorem proving procedures, in: Proceedings of the Third Annual ACM Symposium on Theory of Computing, 1971, pp. 151-158
2. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), W.H. Freeman
3. Monasson R., and Zecchina R. Statistical mechanics of the random K-satisfiability model. Phys. Rev. E 56 (1997) 1357-1370
4. Hogg T., Huberman B.A., and Williams C.P. Phase transitions and the search problem. Artificial Intelligence 81 (1996) 1-15
5. Dubois O., Monasson R., Selman B., and Zecchina (Eds.) R. NP-hardness and Phase transitions. Theoret. Comput. Sci. 265 1-2 (2001) (special issue)
6. Kirkpatrick S., and Selman B. Critical behavior in the satisfiability of random Boolean expressions. Science 264 (1994) 1297-1301
7. Monasson R., Zecchina R., Kirkpatrick S., Selman B., and Troyanski L. Computational complexity from 'characteristic' phase transitions. Nature 400 (1999) 133-137
8. Friedgut E. Sharp Thresholds of Graph Properties, and the k-sat Problem. J. Amer. Math. Soc. 12 4 (1999) 1017-1054 An appendix by J. Bourgain
9. L.M. Kirousis, E. Kranakis, D. Krizanc, A better upper bound for the unsatisfiability threshold, Technical Report TR-96-09, School of Computer Science, Carleton University, 1996
10. Dubois O., and Boufkhad Y. A general upper bound for the satisfiability threshold of random r-sat formulae. J. Algorithms 24 2 (1997) 395-420
11. Achlioptas D., and Moore C. The asymptotic order of the random k-SAT threshold. Proc. Found. Comput. Sci. (2002) 779-788
12. k log 2 - O (k). J. AMS 17 (2004) 947-973
13. Mézard M., and Parisi G. The Bethe lattice spin glass revisited. Eur. Phys. J. B 20 (2001) 217-233 The cavity method at zero temperature, J. Stat. Phys. 111 (2003) 1-34
14. Mézard M., and Zecchina R. Random K-satisfiability problem: From an analytic solution to an efficient algorithm. Phys. Rev. E 66 (2002) 056126
15. Mézard M., Parisi G., and Zecchina R. Analytic and algorithmic solution of random satisfiability problems. Science 297 (2002) 812-815
16. Mertens S., Mézard M., and Zecchina R. Threshold values of Random K-SAT from the cavity method. Random Structures Algorithms 28 (2006) 340-373
17. Braunstein A., Mezard M., and Zecchina R. Survey propagation: an algorithm for satisfiability. Random Structures Algorithms 27 (2005) 201-226
18. Montanari A., and Ricci-Tersenghi F. On the nature of the low-temperature phase in discontinuous mean-field spin glasses. Eur. Phys. J. B 33 (2003) 339-346
19. Montanari A., Parisi G., and Ricci-Tersenghi F. Instability of one-step replica-symmetry-broken phase in satisfiability problems. J. Phys. A 37 (2004) 2073-2091
20. Semerjian G., and Monasson R. A study of pure random walk on random satisfiability problems with "physical" methods. In: Giunchiglia E., and Tacchella A. (Eds). Proceedings of the SAT 2003 Conference. Lecture Notes in Computer Science vol. 2919 (2004), Springer 120-134
21. Mulet R., Pagnani A., Weigt M., and Zecchina R. Coloring random graphs. Phys. Rev. Lett. 89 (2002) 268701
22. Braunstein A., Mulet R., Pagnani A., Weigt M., and Zecchina R. Polynomial iterative algorithms for coloring and analyzing random graphs. Phys. Rev. E 68 (2003) 036702
23. Martin O.C., Mézard M., and Rivoire O. Frozen glass phase in the multi-index matching problem. Phys. Rev. Lett. 93 (2004) 217205
24. Montanari A. The glassy phase of Gallager codes. Eur. Phys. J. B 23 (2001) 121-136
25. Franz S., Leone M., Montanari A., and Ricci-Tersenghi F. Dynamic phase transition for decoding algorithms. Phys. Rev. E 66 (2002) 046120
26. Mézard M., Ricci-Tersenghi F., and Zecchina R. Two solutions to diluted p-spin models and XORSAT problems. J. Stat. Phys. 111 (2003) 505-533
27. Cocco S., Dubois O., Mandler J., and Monasson R. Rigorous decimation-based construction of ground pure states for spin-glass models on random lattices. Phys. Rev. Lett. 90 (2003) 047205
28. O. Dubois, J. Mandler, The 3-XORSAT threshold, Proceedings of the 43th Annual IEEE Symposium on Foundations of Computer Science, Vancouver, 2002, pp. 769-778
29. Mézard M., Mora T., and Zecchina R. Clustering of solutions in the random satisfiability problem. Phys. Rev. Lett. 94 (2005) 197205
30. D. Achlioptas, F. Ricci-Tersenghi, On the solution-space geometry of random constraint satisfaction problems, in: Proc. 38th Annual ACM Symposium on Theory of Computing, 2006, p. 130
31. Montanari A., and Semerjian G. On the dynamics of the glass transition on Bethe lattices. J. Stat. Phys. 124 (2006) 103
32. Mora T., and Mézard M. Geometrical organization of solutions to random linear Boolean equations. J. Stat. Mech. (2006) P10007
33. Creignou N., and Daudé H. Coarse and sharp thresholds for random k-YOR-CNF satisfiability. Inform. Théor. Appl./Theoret. Inform. Appl. 37 2 (2003) 127-147
34. Creignou N., and Daudé H. Combinatorial sharpness criterion and phase transition classification for random CSPs. Inform. Comput. 190 2 (2004) 220-238
35. Erdös P., and Simonovits M. Supermarked graphs and hypergraphs. Combinatorica 3 2 (1982) 181-192
36. Friedgut E. Hunting for sharp thresholds. Random Structures Algorithms 26 1-2 (2005) 27-51
37. Janson S., Luczak T., and Rucinski A. Random Graphs (1999), John Wiley, New York
38. Karonski M., and Luczak T. The phase transition in a random hypergraph. J. Comput. Appl. Math. 142 (2002) 125-135