作者
Stephen A Cook
发表日期
2007/1/1
来源
ACM Turing award lectures
页码范围
1982
简介
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.
引用总数
19851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320248137714107744225364445483888681411961491211131514134
学术搜索中的文章
SA Cook - ACM Turing award lectures, 2007