|
1982 – Stephen A. Cook
Citation
For his advancement of our understanding of the complexity of computation
in a significant and profound way. His seminal paper, "The Complexity of Theorem Proving Procedures,"
presented at the 1971 ACM SIGACT Symposium on the Theory of Computing, Laid the foundations for the
theory of NP-Completeness. The ensuing exploration of the boundaries and nature of NP-complete class
of problems has been one of the most active and important research activities in computer science for
the last decade.
[Home] [ACM Awards] [A. M. Turing Award]
|
