Richard Karp

From Chessprogramming wiki
Jump to: navigation, search

Home * People * Richard Karp

Richard Karp [1]

Richard M. Karp,
an American mathematician, computer scientist and pioneer in theoretical computer science and computational complexity for which he received a Turing Award in 1985, the Harvey Prize in 1998, the Benjamin Franklin Medal in 2004, and the Kyoto Prize in 2008 [2] and several honorary degrees. Richard Karp is professor emeritus at Department of Electrical Engineering and Computer Sciences with additional appointments in mathematics, bioengineering and operations research, University of California, Berkeley. His research interests further include combinatorial algorithms, discrete probability, computational biology, and internet algorithms. Karp introduced the now standard methodology for proving problems to be NP-complete. He is known for Karp's 21 NP-complete problems, the Edmonds–Karp algorithm, the Hopcroft–Karp algorithm, the Karp–Lipton theorem, and the Rabin–Karp algorithm.


According to primary StarTech author Bradley Kuszmaul, Hans Berliner, Richard Karp, David Slate, and Lewis Stiller contributed to a mini-seminar on computer chess held at Thinking Machines Corporation on August 12, 1991. In particular, Richard Karp suggested that StarTech should be based on Berliner’s serial program HiTech rather than GNU Chess [3] .

Selected Publications



1960 ...

1970 ...

1980 ...

1990 ...

2000 ...

2010 ...

External Links


  1. Richard Karp giving a talk at the EPFL on 13th of July 2009, Category:Richard Karp - Wikimedia Commons
  2. Richard M. Karp from Wikipedia
  3. Bradley C. Kuszmaul (1994). Synchronized MIMD Computing. Ph. D. Thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, pdf, pp. 146, Acknowledgments
  4. dblp: Richard M. Karp
  5. Travelling salesman problem from Wikipedia

Up one level