Contents

Richard M. Karp
Algorithms and the theory of computational complexity.
Held–Karp algorithm · Reducibility among combinatorial problems
- Born
- 3 January 1935
- Birthplace
- Boston
More people
Richard M. Karp
American computer scientist whose research helped establish how difficult computational problems relate to one another. Won the 1985 Turing Award.
Early life
Harvard training
Grew up in Boston and studied at Harvard, completing a doctorate in applied mathematics in 1959.
Career
- 1959
IBM
Began research at the Thomas J. Watson Research Center.
- 1968
Berkeley
Became a professor of computer science, mathematics and operations research.
- 2012
Simons Institute
Became founding director of the theory-of-computing institute.
Contributions
Held–Karp algorithm
Developed an exact algorithm for the travelling-salesperson problem with Michael Held.
Reducibility among combinatorial problems
Showed that many important problems share NP-completeness.
Beyond work
Teaching
Received Berkeley's Distinguished Teaching Award in 1986. In an interview, he compared preparing a lecture with preparing a theatrical performance, emphasizing the work needed to communicate ideas clearly.
Sources & photo credit
Biography and career ↗Biographical references ↗Teaching — biographical source ↗Distinctive contribution — source ↗Original photograph. Cropped and displayed in monochrome.
Photo: Rama. CC BY-SA 2.0 fr · Original image. Cropped and displayed in monochrome.