What is Richard M. Karp?
{{Infobox scientist | name = Richard Manning Karp | image = Karp mg 7725-b.cr2.jpg | image_size = | caption = Richard Karp giving a talk at the EPFL on 13th of July 2009 | birth_date = {{Birth date and age|1935|1|3|mf=yes}} | birth_place = [[Boston, Massachusetts|Boston]], [[Massachusetts]] | death_date = | death_place = | residence = | citizenship = | nationality = American | ethnicity = | field = [[Computer Science]] | work_institution = [[University of California, Berkeley]]<br>[[IBM]] | alma_mater = [[Harvard University]] | doctoral_advisor = Anthony Oettinger | doctoral_students = [[Narendra Karmarkar]]<br />[[Michael Luby]]<br />[[Rajeev Motwani]]<br />[[Noam Nisan]]<br />[[Barbara Simons]] | known_for = [[Edmonds–Karp algorithm]]<br />[[Karp's 21 NP-complete problems]]<br />[[Hopcroft–Karp algorithm]]<br />[[Karp–Lipton theorem]]<br />[[Rabin–Karp string search algorithm]] | thesis_title = Some Applications of Logical Syntax to Digital Computer Programming | thesis_year = 1959 | author_abbreviation_bot = | author_abbreviation_zoo = | prizes = [[Turing Award]] <small>(1985)</small><br>[[John von Neumann Theory Prize]] <small>(1990)</small><br>[[National Medal of Science]] <small>(1996)</small><br>[[Harvey Prize]]<br>[[Franklin Institute#The Benjamin Franklin Awards|Benjamin Franklin Medal]]<br>[[Kyoto Prize]] | religion = | footnotes = }} '''Richard Manning Karp''' (born January 3, 1935) is an [[Americans|American]] [[computer scientist]] and [[computational theorist]] at the [[University of California, Berkeley]]. He is known for his research in the [[theory of algorithms]], for which he received a [[Turing Award]] in 1985, [[The Franklin Institute Awards|The Benjamin Franklin Medal in Computer and Cognitive Science in 2004]