Home → Magazine Archive → June 1983 (Vol. 26, No. 6) → An overview of computational complexity → Abstract

An overview of computational complexity

By Stephen A. Cook

Communications of the ACM, Vol. 26 No. 6, Pages 400-408

Save PDF
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.

The full text of this article is premium content


No entries found