Music |
Video |
Movies |
Chart |
Show |
Cook on his thesis work and introduction to complexity theory. (Turing Awardee Clips) View | |
Cook on “The Complexity of Theorem-Proving Procedures“ (Turing Awardee Clips) View | |
Stephen Cook (WikiAudio) View | |
Learning scientist learns how to cook (Benjamin Keep, PhD, JD) View | |
Interview with Stephen Cook, Frontiers of Knowledge Award in Information Technologies (BBVA Foundation) View | |
ToC NP completeness and Cook Levin theorem 1 Introduction and Preliminaries (Video Lectures on Theory of Computation) View | |
A conversation with Stephen Cook (plusmathsorg) View | |
WHY COMPUTING MATTERS: The problems of computational complexity and the problem of academic tenure (Why Computing Matters) View | |
P (complexity) (Audiopedia) View | |
Biggest Puzzle in Computer Science: P vs. NP (Quanta Magazine) View |