Thumbnail
Access Restriction
Subscribed

Author Cook, Stephen A.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Computational complexity
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.
Description Affiliation: Univ. of Toronto, Toronto, Ont., Canada (Cook, Stephen A.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 26
Issue Number 6
Page Count 9
Starting Page 400
Ending Page 408


Open content in new tab

   Open content in new tab
Source: ACM Digital Library