We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
Solving problems in finite time.
- Authors
Anderson, Philip W.
- Abstract
Introduces research on page 133 of this issue, by Monasson et al., that presents a new analysis of the K-SAT problem that illuminates when and why such computer tasks become prohibitive. What the K-SAT problem is; First to be assigned to the class of NP (nondeterministic polynomial time)-complete problems; Attempts to forge a connection between the classic problems of computer complexity theory and statistical mechanics of random systems; Details.
- Subjects
COMPUTATIONAL mathematics; FINITE groups; COMPUTATIONAL complexity; STATISTICAL mechanics; RANDOM sets; MATHEMATICAL models
- Publication
Nature, 1999, Vol 400, Issue 6740, p115
- ISSN
0028-0836
- Publication type
Article
- DOI
10.1038/22001