Complexity-theoretic models of phase transitions in search problems

Theoretical Computer Science

Volumn 249, Issue 2, 2000, Pages 243-263

  Dunne, Paul E ^a   Gibbons, Alan ^a   Zito, Michele ^a  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

Computational complexity; Phase transitions; Search problems

Indexed keywords

EID: 0346639490     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00061-X     Document Type: Article

References (20)

1. B. Bollobás, A. Thomason, Threshold functions, Combinatorica 7 (1987) 35-38.
2. P. Cheeseman, B. Kanefsky, W. Taylor, Where the really hard problems are, Proc. 12th IJCAI, 1991, pp. 331-337.
3. V. Chvátal, B. Reed, Mick gets some (the odds are on his side), Proc. 33rd IEEE FOCS, 1992, pp. 620-627.
4. M. Davis, H. Putnam, A computing procedure for quantification theory, J. ACM 7 (1960) 201-215.
5. P. Erdös, A. Rényi, On random graphs I, Pub. Math. 6 (1959) 290-297.
6. E. Friedgut, G. Kalai, Every monotone graph property has a sharp threshold, Proc. Amer. Mathl. Soc. 124 (1996) 2993-3002.
7. J.W. Freeman, Hard random 3-SAT problems and the Davis-Putnam procedure, Artif. Intell. 81 (1996) 183-198.
8. M.R. Garey, D.S. Johnson, Computers and Intractability, Freeman, New York, 1979.
9. I. Gent, T. Walsh, The TSP phase transition, Artif. Intell. 81 (1996) 59-80.
10. I. Gent, E. MacIntyre, P. Prosser, T. Walsh, The constrainedness of search, Proc. 13th National Conf. on Artificial Intelligence and the Eighth Innovative Applications of Artificial Intelligence Conf. AAAI Press/MIT Press, 1996, pp. 246-252.
11. T. Hogg, B.A. Huberman, C. Williams, Phase transitions and the search problem, Artif. Intell. 81 (1996) 1-15.
12. T. Hogg, C. Williams, The hardest constraint problems: a double phase transition, Artif. Intell. 69 (1994) 359-377.
13. S. Kirkpatrick, B. Selman, Critical behavior in the satisfiability of random Boolean expressions, Science 264 (1994) 1297-1301.
14. L.M. Kirousis, E. Kranakis, D. Krizanc, Approximating the unsatisfiability threshold of random formulas, Proc. 4th Ann. European Symp. on Algorithms, ESA '96, September 1996.
15. A.D. Koršunov, Solution of a problem of Erdös and Rényi on Hamiltonian cycles in nonoriented graphs, Soviet Math. Dokl. 17 (1976) 760-764.
16. L. Levin, Average case complete problems, SIAM J. Comput. 15 (1986) 285-286.
17. E. Koutsapias, C.H. Papadimitriou, On the greedy heuristic for satisfiability, Inform. Proc. Lett. 43 (1992) 53-55.
18. D.G. Mitchell, B. Selman, H.J. Levesque, Hard and easy distributions of SAT problems, Proc. AAAI-92, AAAI Press/MIT Press, 1992, pp. 459-465.
19. L.J. Stockmeyer, A. Meyer, Word problems requiring exponential time, Proc. 5th ACM Symp. on Theory of Computing, 1973, pp. 1-9.
20. H. Wilf, Some examples of combinatorial averaging, Amer. Math. Monthly 92 (1985) 250-261.