Easy predictions for the easy-hard-easy transition

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2002, Pages 688-694

  Parkes, Andrew J ^a  

^a UNIVERSITY OF OREGON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING;

LOCAL SEARCH ALGORITHMS;

ARTIFICIAL INTELLIGENCE;

EID: 0036928933     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. Cheeseman, P.; Kanefsky, B.; and Taylor, W. M. 1991. Where the really hard problems are. In Proceedings of the Ninth National Conference on Artificial Intelligence (AAAI-91), 331-337.
2. Coarfa, C.; Demopoulos, D. D.; Aguirre, A. S. M.; Subramanian, D.; and Vardi, M. Y. 2000. Random 3-SAT: The plot thickens. In Principles and Practice of Constraint Programming, 143-159.
3. Crawford, J. M., and Auton, L. D. 1996. Experimental results on the crossover point in random 3-SAT. Artificial Intelligence 81:31-57.
4. Friedgut, E., and Kalai, G. 1996. Every monotone graph property has a sharp threshold. Proc. Amer. Mathl. Soc. 124:2993-3002.
5. Frieze, A., and Suen, S. 1996. Analysis of two simple heuristics on a random instance of k-SAT. Journal of Algorithms 20:312-355.
6. Gent, I.; MacIntyre, E.; Presser, P.; and Walsh, T. 1997. The scaling of search cost. In Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI-97), 315-320.
7. Kirkpatrick, S., and Selman, B. 1994. Critical behavior in the satisfiability of random boolean expressions. Science 264:1297-1301.
8. Papadimitriou, C. 1994. Computational Complexity. Addison-Wesley.
9. Parkes, A. J. 2001. Distributed local search, phase transitions, and polylog time. In Proceedings of the workshop on "Stochastic Search Algorithms", held at "Seventeenth International Joint Conference on Artificial Intelligence (IJCAI-01)".
10. Selman, B.; Kautz, H.; and Cohen, B. 1996. Local search strategies for satisfiability testing. In Johnson, D. S., and Trick, M. A., eds., Cliques, Coloring and Satisfiability, 521-531. American Mathematical Society. Proceedings of the second DIMACS Implementation Challenge, October 1993.
11. Singer, J.; Gent, I. P.; and Smaill, A. 2000. Local search on random 2+p-sat. In Proceedings of ECAI-2000, 113-117.