Abstract
An historical overview of computational complexity is presented. Emphasis is on the fundamental issues of defining the intrinsic computational complexity of a problem and proving upper and lower bounds on the complexity of problems. Probabilistic and parallel computation are discussed. © 1983, ACM. All rights reserved.
Author supplied keywords
Cite
CITATION STYLE
APA
Cook, S. A. (1983). An overview of computational complexity. Communications of the ACM, 26(6), 400–408. https://doi.org/10.1145/358141.358144
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free