Combinatorial sharpness criterion and phase transition classification for random CSPs

Information and Computation

Volumn 190, Issue 2, 2004, Pages 220-238

  Creignou, Nadia ^a   Daudé, Hervé ^a,b  

^a AIX MARSEILLE UNIVERSITY   (France)

^b CNRS   (France)

Author keywords

Coarse thresholds; Constraint satisfaction problems; Phase transition classification; Sharp thresholds

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; PROBLEM SOLVING; SET THEORY;

COARSE THRESHOLDS; CONSTRAINT SATISFACTION PROBLEMS; PHASE TRANSITION CLASSIFICATION; SHARP THRESHOLDS;

PHASE TRANSITIONS;

EID: 2342515487     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ic.2004.01.002     Document Type: Article

References (18)

1. V. Chvátal, B. Reed, Mick gets some (the odds are on his side), in: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, FOCS'92, 1992, pp. 620-627.
2. N. Creignou, H. Daudé, Satisfiability threshold for random XOR-CNF formulæ, Discrete Appl. Math. 96-97 (1-3) (1999) 41-53.
3. N. Creignou, H. Daudé, Coarse and sharp thresholds for random k-XOR-CNF satisfiability, Theor. Inform. Appl. 37 (2003) 127-147.
4. N. Creignou, H. Daudé, Generalized satisfiability problems: minimal elements and phase transitions, Theor. Comput. Sci. 302 (1-3) (2003) 417-430 (Appeared in an earlier version in: Proceedings of the 5th International Symposium on Theory and Applications of Satisfiability Testing, SAT'2002, Cincinatti, 2002, pp. 17-26).
5. N. Creignou, H. Daudé, Generalized satisfiability problems: minimal elements and phase transitions, Theor. Comput. Sci. 302 (1-3) (2003) 417-430 (Appeared in an earlier version in: Proceedings of the 5th International Symposium on Theory and Applications of Satisfiability Testing, SAT'2002, Cincinatti, 2002, pp. 17-26).
6. N. Creignou, S. Khanna, M. Sudan, Complexityclassifications of Boolean constraint satisfaction problems. SIAMMonographs on discrete mathematics and applications, 2001.
7. O. Dubois, J. Mandler, The 3-XORSAT threshold, in: Proceedings of the of the 43rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'2002, Vancouver, 2002, pp. 769-778. Also C. R. Acad. Sci. Paris Ser. 1335 (2002) 963-966.
8. O. Dubois, J. Mandler, The 3-XORSAT threshold, in: Proceedings of the of the 43rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'2002, Vancouver, 2002, pp. 769-778. Also C. R. Acad. Sci. Paris Ser. 1335 (2002) 963-966.
9. E. Friedgut and an appendix by J. Bourgain, Sharp thresholds of graph properties, and the k-sat problem, J. A.M.S. 12 (4) (1999) 1017-1054.
10. A. Goerdt, A threshold for unsatisfiability, J. Comput. Syst. Sci. 53 (3) (1996) 469-486.
11. S. Janson, Poisson convergence and Poisson processes with applications to random graphs, Stochastic Process. Appl. 26 (1) (1987) 1-30.
12. S. Kirkpatrick, B. Selman, Critical behavior in the satisfiability of random Boolean expressions, Science 264 (1994) 1297-1301.
13. E. MacIntyre, P. Prosser, B. Smith, T. Walsh, Random constraint satisfaction, flaws and structure, Constraints 6 (4) (2001) 345-372.
14. M. Molloy, Models for random constraint satisfaction problems, SIAM J. Comput. 32 (4) (2003) 935-949 (Appeared in an earlier version in: Proceedings of the 34th Annual ACM Symposium on Theory of Computing, STOC'2002 Montreal, 2002, pp. 209-217).
15. M. Molloy, Models for random constraint satisfaction problems, SIAM J. Comput. 32 (4) (2003) 935-949 (Appeared in an earlier version in: Proceedings of the 34th Annual ACM Symposium on Theory of Computing, STOC'2002 Montreal, 2002, pp. 209-217).
16. T.J. Schaefer, The complexity of satisfiability problems, in: Proceedings of the 10th Annual ACM Symposium on Theory of Computing, STOC'1978, San Diego, 1978, pp. 216-226.
17. L. Takács, On the limit distribution of the number of cycles in a random graph, J. Appl. Probab. 25 (A) (1988) 359-376.
18. K. Xu, W. Li, Exact phase transitions in random constraint satisfaction problems, J. Artif. Intell. Res. 12 (2000) 93-103.