Computational science: Can get satisfaction

Nature

Volumn 435, Issue 7043, 2005, Pages 751-752

  Gomes, Carla P ^a   Selman, Bart ^b  

^a 4148 Upson Hall ^*  (United States)

^b School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; PROBLEM SOLVING;

SHEER COMPLEXITY;

COMPUTATIONAL COMPLEXITY;

COMPUTER;

ALGORITHM; COMPUTER; COMPUTER PROGRAM; MATHEMATICAL ANALYSIS; PHASE TRANSITION; PRIORITY JOURNAL; PROBABILITY; SHORT SURVEY;

EID: 20544441190     PISSN: 00280836     EISSN: None     Source Type: Journal    
DOI: 10.1038/435751a     Document Type: Short Survey

References (11)

1. Achlioptas, D., Naor, A, & Peres, Y. Nature 435, 759-764 (2005).
2. Clay Mathematics Institute The P versus NP problem www.claymath.org/ prizeproblems/pvsnp.htm
3. Cheeseman, P., Kanefsky, B. & Taylor. W. Proc. 12th Int. Joint Conf. Artif Intell. 331-337 (Morgan Kaufmann, San Francisco, CA, 1991).
4. Mitchell, D., Selman, B. & Levesque, H. Proc. 10th Natl Conf. Artif. Intell. 459-465 (AAAI Press, Menlo Park, CA, 1992).
5. Kirkpatrick, S. & Selman, B. Science 264, 1297-1301 (1994).
6. Hogg, T., Huberman, B. A. & Williams, C. (eds) Frontiers in Problem Solving: Phase Transitions and Complexity spec. issue Artif. Intell. 81 (1996).
7. Friedgut, E. J. Am. Math. Soc. 12, 1017-1054 (1999).
8. Monasson, R., Zecchina, R., Kirkpatrtck, S., Selman, B. & Troyansky, L. Nature 400, 133-137 (1999).
9. Mezard, M., Parisi, G. & Zecchina, R. Science 297, 812-815 (2002).
10. Mezard, M., Mora, T. & Zecchina, R. preprint at http://arxiv.org/ cond-mat/0504070 (2005).
11. Williams, R., Gomes, C. & Selman, B. Proc. 17th Int. Joint Conf. Artif. Intell. 1173-1178 (Morgan Kaufmann, San Francisco, CA, 2003).