The sheer complexity of some computational problems means they will probably never be solved, despite the ever-increasing resources available. But we can sometimes predict under what conditions solutions exist.
This is a preview of subscription content, access via your institution
Access options
Subscribe to this journal
Receive 51 print issues and online access
$199.00 per year
only $3.90 per issue
Buy this article
- Purchase on Springer Link
- Instant access to full article PDF
Prices may be subject to local taxes which are calculated during checkout
References
Achlioptas, D., Naor, A. & Peres, Y. Nature 435, 759–764 (2005).
Clay Mathematics Institute The P versus NP problem http://www.claymath.org/prizeproblems/pvsnp.htm
Cheeseman, P., Kanefsky, B. & Taylor, W. Proc. 12th Int. Joint Conf. Artif. Intell. 331—337 (Morgan Kaufmann, San Francisco, CA, 1991).
Mitchell, D., Selman, B. & Levesque, H. Proc. 10th Natl Conf. Artif. Intell. 459–465 (AAAI Press, Menlo Park, CA, 1992).
Kirkpatrick, S. & Selman, B. Science 264, 1297–1301 (1994).
Hogg, T., Huberman, B. A. & Williams, C. (eds) Frontiers in Problem Solving: Phase Transitions and Complexity spec. issue Artif. Intell. 81 (1996).
Friedgut, E. J. Am. Math. Soc. 12, 1017–1054 (1999).
Monasson, R., Zecchina, R., Kirkpatrick, S., Selman, B. & Troyansky, L. Nature 400, 133–137 (1999).
Mezard, M., Parisi, G. & Zecchina, R. Science 297, 812–815 (2002).
Mezard, M., Mora, T. & Zecchina, R. preprint at http://arxiv.org/cond-mat/0504070 (2005).
Williams, R., Gomes, C. & Selman, B. Proc. 17th Int. Joint Conf. Artif. Intell. 1173–1178 (Morgan Kaufmann, San Francisco, CA, 2003).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Gomes, C., Selman, B. Can get satisfaction. Nature 435, 751–752 (2005). https://doi.org/10.1038/435751a
Published:
Issue Date:
DOI: https://doi.org/10.1038/435751a
This article is cited by
-
A hard statistical view
Nature (2008)
