Back to Search
Start Over
Simplifying Complexity.
- Source :
-
Scientific Computing & Instrumentation . Jul2004, Vol. 21 Issue 8, p10-50. 2p. - Publication Year :
- 2004
-
Abstract
- Focuses on the algorithmic contributions of Richard M. Karp in simplifying computational complexity. Recipient of the 2004 Benjamin Franklin Medal from the Franklin Institute; Complexity issues on polynomial and nonpolynomial (NP) problems; Karp's NP-Complete problem, which is a class of hard problems that all simplify to a single hard, NP problem.
Details
- Language :
- English
- ISSN :
- 15242560
- Volume :
- 21
- Issue :
- 8
- Database :
- Academic Search Index
- Journal :
- Scientific Computing & Instrumentation
- Publication Type :
- Periodical
- Accession number :
- 13861885