KnowraStephen CookLinked fromLinked fromThe 7 pages that link to Stephen Cook, each with the reason it gives.All 7Related 7Computational complexity theoryRelated: His 1971 result established a central method for demonstrating computational hardness.Boolean satisfiability problemRelated: Cook proved that every problem in NP reduces to SAT in polynomial time.Cook–Levin theoremRelated: His 1971 paper proved satisfiability NP-complete.Analysis of algorithmsRelated: NP-completeness transformed algorithm analysis into a study of problem-wide computational hardness.Leonid LevinRelated: Cook reached the central completeness result independently of Levin.Hartmanis–Stearns conjectureRelated: His work made the P-versus-NP question precise through reductions and complete problems.Richard M. KarpRelated: Cook’s theorem gave Karp the foundational result from which his reductions proceeded.