Can get satisfaction

Carla P. Gomes and Bart Selman ()
Additional contact information
Carla P. Gomes: Faculty of Computing and Information Science
Bart Selman: Faculty of Computing and Information Science

Nature, 2005, vol. 435, issue 7043, 751-752

Abstract: 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.

Date: 2005
References: Add references at CitEc
Citations:

Downloads: (external link)
https://www.nature.com/articles/435751a Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:nat:nature:v:435:y:2005:i:7043:d:10.1038_435751a

Ordering information: This journal article can be ordered from
https://www.nature.com/

DOI: 10.1038/435751a

Access Statistics for this article

Nature is currently edited by Magdalena Skipper

More articles in Nature from Nature
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().