Publication Date
2012
Selected Works Department
University Studies
Document Type
Article
Abstract
Stephen A. Cook, winner of the 1982 AM Turing Award, reflects on his career. nature of nP-complete class of problems has been one of the most active and important research activities in computer science.” Cook further discusses the feasibility of solving the P versus nP problem, which has recently received renewed attention given increasingly powerful computational capabilities and the decreasing cost of computing. In a September 2009 Communications article, Lance Fortnow wrote that Cook's work on computational ...
File Name
Frana007_FT
Recommended Citation
Frana, Philip, "An Interview with Stephen A. Cook" (2012). Selected Works. 201.
https://commons.lib.jmu.edu/selectedworks/201
COinS
