cover image

Richard M. Karp

American mathematician / From Wikipedia, the free encyclopedia

Dear Wikiwand AI, let's keep it short by simply answering these key questions:

Can you list the top facts and stats about Richard M. Karp?

Summarize this article for a 10 years old


Richard Manning Karp (born January 3, 1935) is an American computer scientist and computational theorist at the University of California, Berkeley. He is most notable for his research in the theory of algorithms, for which he received a Turing Award in 1985, The Benjamin Franklin Medal in Computer and Cognitive Science in 2004, and the Kyoto Prize in 2008.[2]

Quick facts: Richard Manning Karp, Born, Nationality, Alma...
Richard Manning Karp
Richard Karp at the EPFL on 13th of July 2009
Born (1935-01-03) January 3, 1935 (age 88)
Alma materHarvard University
Known forAanderaa–Karp–Rosenberg conjecture
Edmonds–Karp algorithm
Held–Karp algorithm
Hopcroft–Karp algorithm
Karmarkar–Karp algorithm
Rabin–Karp string search algorithm
Karp–Lipton theorem
Karp's 21 NP-complete problems
Vector addition system
AwardsFulkerson Prize (1979)
Turing Award (1985)
John von Neumann Theory Prize (1990)
IEEE Computer Society Charles Babbage Award (1995)
National Medal of Science (1996)
Harvey Prize (1998)
EATCS award (2000)
Benjamin Franklin Medal (2004)
Kyoto Prize (2008)
Scientific career
FieldsComputer Science
InstitutionsUniversity of California, Berkeley
ThesisSome Applications of Logical Syntax to Digital Computer Programming (1959)
Doctoral advisorAnthony Oettinger[1]
Doctoral students

Karp was elected a member of the National Academy of Engineering (1992) for major contributions to the theory and application of NP-completeness, constructing efficient combinatorial algorithms, and applying probabilistic methods in computer science.