Richard Manning Karp is an American computer scientist and computational theorist at the University of California, Berkeley, most notable for his research in the theory of algorithms. He received the 1985 ACM Turing Award, the Benjamin Franklin Medal in Computer and Cognitive Science in 2004, and the Kyoto Prize in 2008.
Facts
Notable WorkReducibility Among Combinatorial Problems (21 NP-complete problems) 1 BirthplaceBoston, Massachusetts, United States 1 In the Other Atlases
Sources
1. Richard M. Karp, Wikipedia
Lead paragraph, birth
born January 3, 1935
Lead paragraph, nationality
is an American computer scientist
Biography section
Born to parents Abraham and Rose Karp in Boston, Massachusetts
Work section
in 1972 he published a landmark paper in complexity theory, 'Reducibility Among Combinatorial Problems', in which he proved 21 problems to be NP-complete
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.