A sharp threshold for a random constraint satisfaction problem

Discrete Mathematics

Volumn 285, Issue 1-3, 2004, Pages 301-305

  Flaxman, Abraham D ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Constraint satisfaction; Phase transition; Random structures; Threshold phenomena

Indexed keywords

CONSTRAINT THEORY; PHASE TRANSITIONS; PROBABILITY; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

CONSTRAINT SATISFACTION; RANDOM STRUCTURES; SECOND MOMENT METHOD; THRESHOLD PHENOMENA;

RANDOM PROCESSES;

EID: 3142530943     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2004.05.002     Document Type: Article

References (23)

1. D. Achlioptas, Setting two variables at a time yields new lower bound for random 3-SAT, Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, 2000, pp. 28-37.
2. D. Achlioptas, A.D. Chtcherba, G. Istrate, C. Moore, The phase transition in 1-in-k SAT and NAE 3-SAT, Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, 2001, pp. 721-722.
3. D. Achlioptas, C. Moore, The two-colorability of random hypergraphs, Sixth International Workshop on Randomization and Approximation Techniques in Computer Science, 2002.
4. k(ln 2-O(k)) , 35th Annual ACM Symposium on Theory of Computing, 2003.
5. D. Achlioptas, G. Sorkin, Optimal myopic algorithms for random 3-SAT, Proceedings of the 41st Annual IEEE Symposium on Foundations of Computing, 2000, pp. 590-600.
6. B. Bollobás, C. Borgs, J. Chayes, J.H. Kim, D.B. Wilson, The scaling window of the 2-SAT transition, 1999, manuscript.
7. A.Z. Broder, A.M. Frieze, E. Upfal, On the satisfiability and maximum satisfiability of random 3-CNF formulas, Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 1993, pp. 322-330.
8. Chao M.T., Franco J. Probabilistic analysis of 2 heuristics for the 3-satisfiability problem. SIAM J. Comput. 15:1986;1106-1118.
9. Chao M.T., Franco J. Probabilistic analysis of a generalization of the unit-clause literal selection heuristic for the. k satisfiability problem Inform. Sci. 51:1990;289-314.
10. V. Chvátal, B. Reed, Mick gets some (the odds are on his side), Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, 1992, pp. 620-627.
11. Creignou N., Daudé H. Generalized satisfiability problems. minimal elements and phase transitions Theoret. Comput. Sci. 302:2003;417-430.
12. O. Dubois, Y. Boufkhad, J. Mandler, Typical random 3-SAT formulae and the satisfiability threshold, Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, 2000, pp. 126-127.
13. W. Fernandez de la Vega, On Random 2-sat, 1992, manuscript.
14. Friedgut E. Necessary and sufficient conditions for sharp thresholds of graph properties, and the. k -SAT problem J. Amer. Math. Soc. 12:1999;1017-1054.
15. A.M. Frieze, G. Sorkin, A note on random 2-SAT with prescribed literal degrees, Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, 2002.
16. Frieze A.M., Suen S. Analysis of two simple heuristics on a random instance of. k -SAT J. Algorithms. 20(2):1996;312-355.
17. A.M. Frieze, N.C. Wormald, Random k -SAT: A tight threshold for moderately growing k , Proceedings of the Fifth International Symposium on Theory and Applications of Satisfiability Testing, 2002, pp. 1-6.
18. Goerdt A. A threshold for unsatisfiability. J. Comput. System Sci. 33:1996;469-486.
19. Janson S., Satmatiou Y., Vamvakari M. Bounding the unsatisfiability threshold of random 3-SAT. Random Struct. Algorithms. 17:2000;103-116.
20. A.C. Kaporis, L.M. Kirousis, E.G. Lalas, The probabilistic analysis of a greedy satisfiability algorithm, Proceedings of the Fifth International Symposium on Theory and Applications of Satisfiability Testing, 2002, pp. 362-376.
21. Kirousis L.M., Kranakis E., Krizanc D., Stamatiou Y.C. Approximating the unsatisfiability threshold of random formulas. Random Struct. Algorithms. 17:2000;103-116.
22. Verhoeven Y. Random 2-SAT and unsatisfiability. Inform. Process. Lett. 72:1999;119-123.
23. Xu K., Li W. Exact phase transitions in random constraint satisfaction problems. J. Artif. Intell. Res. 12:2000;93-103.