Random formulas have frozen variables

SIAM Journal on Computing

Volumn 39, Issue 1, 2009, Pages 260-280

  Achlioptas, Dimitris ^a   Ricci Tersenghi, Federico ^b  

^a University of California   (United States)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Frozen variables; Phase transitions; Random formulas; Satisfiability

Indexed keywords

EXPONENTIAL NUMBERS; FROZEN VARIABLES; HYPERGRAPH COLORING; LOWER DENSITY; POLYNOMIAL-TIME ALGORITHMS; RANDOM CONSTRAINT SATISFACTION PROBLEMS; RANDOM FORMULAS; RANDOM GRAPHS; SATISFIABILITY; SURVEY PROPAGATION;

COMPUTATION THEORY; GRAPH THEORY; STEELMAKING;

PHASE TRANSITIONS;

EID: 67650145886     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/070680382     Document Type: Conference Paper

References (24)

1. D. ACHLIOPTAS, A. COJA-OGHLAN, AND F. RICCI-TERSENGHI, Random Formulas Have Exponentially Many Solution Clusters, submitted.
2. D. ACHLIOPTAS AND C. MOORE, Random κ-SAT: Two moments suffice to cross a sharp threshold, SIAM J. Comput., 36 (2006), pp. 740-762.
3. D. ACHLIOPTAS AND A. NAOR, The two possible values of the chromatic number of a random graph, Ann. of Math., 162 (2005), pp. 1335-1351.
4. D. ACHLIOPTAS AND C. MOORE, The chromatic number of random regular graphs, in Proceedings of the 7th International Workshop on Randomization and Approximation Techniques in Computer Science, Lecture Notes in Comput. Sci. 3122, Springer, Berlin, 2004, pp. 219-228.
5. D. ACHLIOPTAS, A. NAOR, AND Y. PERES, The fraction of satisfiable clauses in a typical formula, J. ACM, 54 (2), Article 10, (2007).
6. D. ACHLIOPTAS, A. NAOR, AND Y. PERES, Rigorous location of phase transitions in hard optimization problems, Nature, 435 (2005), pp. 759-764.
7. κ ln2 - O(κ), J Amer. Math. Soc., 17 (2004), pp. 947-973.
8. S. AJI AND R. J. MCELIECE, The generalized distributive law, IEEE Trans. Inform. Theory, 46 (2000), pp. 325-343.
9. M. ALEKHNOVICH AND E. BEN-SASSON, Linear upper bounds for random walk on small density random 3CNFs, SIAM J. Comput., 36 (2007), pp. 1248-1263.
10. A. BRAUNSTEIN AND R. ZECCHINA, Survey propagation as local equilibrium equations, J. Stat. Mech., (2004), P06007.
11. M.-T. CHAO AND J. FRANCO, Probabilistic analysis of two heuristics for the 3-satisfiability problem, SIAM J. Comput., 15 (1986), pp. 1106-1118.
12. V. CHVÁTAL AND B. REED, Mick gets some (the odds are on his side), in Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, IEEE Comput. Soc. Press, Los Alamitos, CA, 1992, pp. 620-627.
13. O. DUBOIS AND Y. BOUFKHAD, A general upper bound for the satisfiability threshold of random r-SAT formulae, J. Algorithms, 24 (1997), pp. 395-420.
14. O. DUBOIS, Y. BOUFKHAD, AND J. MANDLER, Typical random 3-SAT formulae and the satis-fiablity threshold, Electronic Colloquium on Computational Complexity, 10 (2003).
15. A. M. FRIEZE AND S. SUEN, Analysis of two simple heuristics on a random instance of k-SAT, J. Algorithms, 20 (1996), pp. 312-355.
16. M. HAJIAGHAYI AND G. SORKIN, The Satisfiability Threshold of Random 3-SAT is at least. 3.52, IBM Technical Report: RC22942, 2003.
17. A. KAMATH, R. MOTWANI, K. PALEM, AND P. SPIRAKIS, Tail bounds for occupancy and the satisfiability threshold conjecture, Random Structures Algorithms, 7 (1995), pp. 59-80.
18. A. KAPORIS, L. M. KIROUSIS, AND E. G. LALAS, The probabilistic analysis of a greedy satisfiability algorithm, in Proceedings of the 10th Annual European Symposium on Algorithms, Lecture Notes in Comput. Sci. 2461, Springer, Berlin, 2002, pp. 574-585.
19. A. KAPORIS, L. M. KIROUSIS, AND E. G. LALAS, Selecting complementary pairs of literals, Electron. Notes Discrete Math., 16 (2003), pp. 47-70.
20. L. M. KIROUSIS, E. KRANAKIS, D. KRIZANC, AND Y. STAMATIOU, Approximating the unsat-isfiability threshold of random formulas, Random Structures Algorithms, 12 (1998), pp. 253-269.
21. F. KRZAK,ALA, 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.
22. E. MANEVA, E. MOSSEL, AND M. J. WAINWRIGHT, A new look at survey propagation and its generalizations, J. ACM, 54 (4), Article 17, (2007).
23. M. MÉZARD, G. PARISI, AND R. ZECCHINA, Analytic and algorithmic solution of random satisfiability problems, Science, 297 (2002), pp. 812-815.
24. N. C. WORMALD, Differential equations for random processes and random graphs, Ann. Appl. Probab., 5 (1995), pp. 1217-1235.