KnowraCook–Levin theoremLinked fromLinked fromThe 13 pages that link to Cook–Levin theorem, each with the reason it gives.All 13Broader topic 6Related 7Computational complexity theoryBroader topic: It launched the systematic study of NP-complete problems.NP-completenessBroader topic: It supplies the first NP-complete problem, enabling reductions to establish hardness for others.P versus NP problemBroader topic: It supplies a canonical starting point for proving NP-completeness.Polynomial-time reductionBroader topic: It supplies the foundational starting point for many NP-completeness proofs.Many-one reductionBroader topic: Its reduction from nondeterministic computation launched the chain of NP-completeness proofs.Stephen CookBroader topic: Cook’s 1971 result established the first NP-complete problem.