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}
}
  • S. Cook
  • Published 1983
  • Mathematics, Computer Science
  • Commun. ACM
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. 
Theoretical Computer Science: Computational Complexity
A parallel algorithm for the monadic unification problem
Computing in Combinatorial Optimization
  • W. Cook
  • Computer Science
  • Computing and Software Science
  • 2019
Algorithm - Some Theory†
A Monte Carlo Algorithm for the Satisfiability Problem
Juris Hartmanis: the beginnings of computational complexity
  • R. Stearns
  • Computer Science
  • [1988] Proceedings. Structure in Complexity Theory Third Annual Conference
  • 1988
Classifying the Computational Complexity of Problems
The Computational Complexity Column
...
1
2
3
4
5
...

References

On Spectra
  • Doctoral dissertation,
  • 1962