# An overview of computational complexity

@article{Cook1983AnOO, title={An overview of computational complexity}, author={S. Cook}, journal={Commun. ACM}, year={1983}, volume={26}, pages={400-408} }

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.

#### Topics from this paper

#### 78 Citations

Juris Hartmanis: the beginnings of computational complexity

- Computer Science
- [1988] Proceedings. Structure in Complexity Theory Third Annual Conference
- 1988

New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P

- Computer Science
- IEEE Transactions on Computers
- 1986

Classifying the Computational Complexity of Problems

- Mathematics, Computer Science
- J. Symb. Log.
- 1987

#### References

On Spectra

- Doctoral dissertation,
- 1962