Models for random constraint satisfaction problems

SIAM Journal on Computing

Volumn 32, Issue 4, 2003, Pages 935-949

  Molloy, Michael ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

Constraint satisfaction problems; Random models; Sharp threshold; Threshold

Indexed keywords

GRAPH THEORY; MAXIMUM LIKELIHOOD ESTIMATION; PROBLEM SOLVING;

RANDOM MODELS;

RANDOM PROCESSES;

EID: 0141534116     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539700368667     Document Type: Article

References (14)

1. D. ACHLIOPTAS, Threshold Phenomena in Random Graph Colouring and Satisfiability, Ph.D. Thesis, Department of Computer Science, University of Toronto, 1999.
2. D. ACHLIOPTAS, personal communication.
3. D. ACHLIOPTAS AND E. FRIEDGUT, A threshold for k-colourability, Random Structures Algorithms, 14 (1999), pp. 63-70.
4. D. ACHLIOPTAS, L. KIROUSIS, E. KRANAKIS, AND D. KRIZANC, Rigorous results for random (2 + p)-SAT, in Proceedings of RALCOM '97, Santorini, Greece, 1997, pp. 14-23.
5. D. ACHLIOPTAS, L. KIROUSIS, E. KRANAKIS, D. KRIZANC, M. MOLLOY, AND Y. STAMATIOU, Random constraint satisfaction: A more accurate picture, Constraints, 6 (2001), pp. 329-344.
6. N. ALON AND J. SPENCER, The Probabilistic Method, Wiley, New York, 1992.
7. B. BOLLOBÁS, Random Graphs, Academic Press, New York, 1985.
8. N. CREIGNOU AND H. DAUDÉ, Random generalized satisfiability problems, in Proceedings of the 5th International Symposium on the Theory and Applications of Satisfiability Testing, Cincinnati, OH, 2002, pp. 17-26.
9. P. ERDÖS AND A. RÉNYI, On the evolution of random graphs, Publication of the Mathematical Institute of the Hungarian Academy of Sciences, 5 (1960), pp. 17-61.
10. E. FRIEDGUT, personal communication.
11. E. FRIEDGUT, Sharp thresholds of graph properties and the k-SAT problem, with an appendix by J. Bourgain, J. Amer. Math. Soc., 12 (1999), pp. 1017-1054.
12. I. GENT, E. MACINTYRE, P. PROSSER, B. SMITH, AND T. WALSH, Random constraint satisfaction: Flaws and structure, Constraints, 6 (2001), pp. 345-372.
13. R. KARP, The transitive closure of a random digraph, Random Structures Algorithms, 1 (1990), pp. 73-93.
14. M. MOLLOY, When does the giant component bring unsatisfiability?, in preparation.