Karp, Richard M., 1935-
Enlarge text Shrink text-
Save successfulThe item can be found in your Personal ZoneשגיאהLog in to your account to save
Information for Authority record
Sources of Information
- Average case analysis of a heuristic for the assignment problem, 1991:t.p. (Richard M. Karp)
- OCLC database, Aug. 4, 2010(hdg.: Karp, Richard ; usage: Richard Karp) (hdg.: Karp, Richard M. ; usages: R. Karp, R. M. Karp, Richard Manning Karp) (hdg.: Karp, Richard M., 1935- ; usages: R. M. Karp, Richard Karp, Richard M. Karp) (hdg.: Karp, Richard Manning ; usages: Richard M. Karp, Richard Manning Karp)
- Univ. of California at Berkeley WWW homepage, Aug. 4, 2010(Univ. Prof., department of electrical engineering and computer sciences with additional appointments in mathematics, bioengineering and operations research at U.C. Berkeley; Ph. D., Harvard Univ.)
1 / 1
Wikipedia description:
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 the 1985 ACM Turing Award, The Benjamin Franklin Medal in Computer and Cognitive Science in 2004, and the Kyoto Prize in 2008. 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.
Read more on Wikipedia >