## An overview of computational complexity (1983)

Venue: | Communications of the ACM |

Citations: | 17 - 0 self |

### BibTeX

@ARTICLE{Cook83anoverview,

author = {Stephen A. Cook},

title = {An overview of computational complexity},

journal = {Communications of the ACM},

year = {1983},

volume = {26},

pages = {401--408}

}

### Years of Citing Articles

### OpenURL

### Abstract

foremost recognition of technical contributions to the computing community. The citation of Cook's achievements noted that "Dr. Cook has advanced 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 the NP-complete class of problems has been one of the most active and important research activities in computer science for the last decade. Cook is well known for his influential results in fundamental areas of computer science. He has made significant contributions to complexity theory, to time-space tradeoffs in computation, and to logics for programming languages. His work is characterized by elegance and insights and has illuminated the very nature of computation." During 1970-1979, Cook did extensive work under grants from the