Richard M. Karp

Prix

1. 1985

   prix Turing

   Informatique

   for his continuing contributions to the theory of algorithms including the development of efficient algorithms for network flow and other combinatorial optimization problems, the identification of polynomial-time computability with the intuitive notion of algorithmic efficiency, and, most notably, contributions to the theory of NP-completeness

2. 2008

   Prix Kyoto — Technologie avancée

   Informatique

   Fundamental Contributions to the Development of the Theory of Computational Complexity.