Random constraint satisfaction: A more accurate picture

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1330, Issue , 1997, Pages 107-120

  Achlioptas, Dimitris ^a   Kirousis, Lefteris M ^b   Kranakis, Evangelos ^c   Krizanc, Danny ^c   Molloy, Michael S O ^a   Stamatiou, Yannis C ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b UNIVERSITY OF PATRAS   (Greece)

^c CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY;

LOWER AND UPPER BOUNDS; OVER-CONSTRAINED; RANDOM CONSTRAINT SATISFACTION PROBLEMS; RANDOM CONSTRAINTS; RANDOM K-SAT; THEORETICAL POINTS; UNDER-CONSTRAINED;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84948976066     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0017433     Document Type: Conference Paper

References (31)

1. D. Achlioptas and M. Molloy, "Almost all graphs with 2.522 n edges are not 3-colorable," Manuscript, University of Toronto.
2. N. Alon, J.H. Spencer, and P. Erdös, The Probabilistic Method, J. Wiley, New York (1992).
3. D.G. Bobrow and M. Brady, eds., Special Volume on Frontiers in Problem Solving: Phase Transitions and Complexity, Guest editors: T. Hogg, B.A. Hubermann, and C.P. Williams, Artificial Intelligence, Vol. 81, Numbers 1-2 (1996).
4. B. Bollobás, Random Graphs, Academic Press, London (1985).
5. A.Z. Broder, A.M. Frieze, and E. Upfal, "On the satisfiability and maximum satisfiability of random 3-CNF formulas," Proceedings of the Fourth Annual ÅCM-SIAM Symposium on Discrete Algorithms (1993) 322-330.
6. M.-T. Chao and J. Franco, "Probabilistic analysis of two heuristics for the 3-satisfiability problem," SIAM Journal on Computing, Vol. 15 (1986) 1106-1118.
7. M.-T. Chao and J. Franco, "Probabilistic analysis of a generalization of the unit-clause literal selection heuristic for the 4-satisfiability problem," Information Science, Vol. 51 (1990) 289-314.
8. P. Cheeseman, B. Kanefsky and W. Taylor, "Where the really hard problems are," Proceedings of IJCAI '91 (1991) 331-337.
9. V. Chvátal and B. Reed, "Mick gets some (the odds are on his side)," in Proceedings of 33rd IEEE Symposium on Foundations of Computer Science (1992) 620-627.
10. R. Dechter, "Constraint networks," in S. Shapiro (ed.), Encyclopedia of Artificial Intelligence, Wiley, New York, 2nd ed. (1992) 276-285.
11. O. Dubois and Y. Boufkhad, A General Upper Bound for the Satisfiability Threshold of Random r-SAT Formulae, Preprint, LAFORIA, CNRS-Université Paris 6, 1996.
12. P. Erdös and A. Rényi, "On the evolution of random graphs," Publ. of the Math. Inst, of the Hung. Acad. Sci., Vol. 5 (1960) 17-61.
13. A. El Maftouhi and W. Fernandez de la Vega, "On random 3-SAT," Combinatorics, Probability and Computing, Vol. 4 (1995) 189-195.
14. E. Friedgut, "Sharp thresholds for graph properties and the fc-sat problem," Manuscript in preparation.
15. A. Frieze and S. Suen, "Analysis of two simple heuristics on a random instance of fc-SAT," Journal of Algorithms, Vol. 20 (1996) 312-355.
16. A. Goerdt, "A threshold for satisfiability," in I.M. Haven and V. Koubek (eds.) Proceedings of the Symposium on the Mathematical Foundations of Computer Science (1992) 264-274.
17. T. Hogg, "Refining the phase transition in combinatorial search," in [3], 127-154.
18. J. Kahn, G. Kalai, and N. Linial, "The influence of variables on Boolean functions," Proceedings of the 29th Annual Symposium on the Foundations of Computer Science (1988) 68-80.
19. A. Kamath, R. Motwani, K. Palem, and P. Spirakis, "Tail bounds for occupancy and the satisfiability threshold conjecture," Random Structures and Algorithms, Vol. 7 (1995) 59-80.
20. S. Kirkpatrick and B. Selman, "Critical behavior in the satisfiability of random Boolean expressions," Science 264, pp 1297-1301, 1994.
21. L. M. Kirousis, E. Kranakis, and D. Krizanc, "Approximating the unsatisfiability threshold of random formulas," Proceedings of the Fourth Annual European Symposium on Algorithms, ESA '96, (1996) 27-38.
22. A.K. Mackworth, "Constraint satisfaction," in S. Shapiro (ed.) Encyclopedia of Artificial Intelligence, Wiley, New York, 2nd ed. (1992) 285-293.
23. C. McDiarmid, "On a correlation inequality of Farr," Combinatorics, Probability and Computing, Vol. 1 (1992) 157-160.
24. D. Mitchell, B. Selman, and H. Levesque, Generating hard satisfiability problems, Artificial Intelligence, Vol. 81 (1996), 17-29.
25. P. Prosser, "An empirical study of phase transitions in binary constraint satisfaction problems," in [3], 81-109.
26. B.M. Smith and M.E. Dyer, "Locating the phase transition in binary constraint satisfaction problems," in [3], 155-181.
27. J. H. Spencer, Ten Lectures on the Probabilistic Method, 2nd edition, SIAM, Philadelphia (1994).
28. D. Waltz, "Understanding line drawings of scenes with shadows," The Psychology of Computer Vision, McGraw-Hill, New York (1975) 19-91.
29. C, Williams and T. Hogg, "Using deep structure to locate hard problems," Proceedings of AAAI-92 (1992) 472-477.
30. C. Williams and T. Hogg, "Extending deep structure," Proceedings of AAAI-93, (1993) 152-158.
31. C. Williams and T. Hogg, "Exploiting the deep structure of constraint problems," Artificial Intelligence, Vol. 70 (1994) 73-117.