Tolong jelaskan mengenai Karya dari Stephen Cook

On the Minimum Computation Time of Functions (1966) (Tesis)

IP Address 76 Success Secrets - 76 Most Asked Questions on IP Address - What You Need to Know

‘P versus NP’ and the Limits of Computation  - Public lecture given by Stephen Cook at the University of Toronto

Oral history interview with Stephen Cook at Charles Babbage Institute, University of Minnesota.   Cook discussed his education at the University of Michigan and Harvard University and early work at the University of California, Berkeley, and his growing interest in problems of computational complexity. Cook recounted his move to the University of Toronto in 1970 and the reception of his work on NP-completeness, leading up to his A.M. Turing Award.