Stephen Cook

Prix

1. 1982

   prix Turing

   Informatique

   for "his advancement of our understanding of the complexity of computation in a significant and profound way"; the citation in particular mentions his paper "The Complexity of Theorem Proving Procedures," which is credited with founding the theory of NP-completeness