Proof — Cook–Levin theorem
Statement
SAT is NP-complete; complexity theory. Proved in ZFC.
Source
ACM Turing Award 1982. SAT is NP-complete; complexity theory. Proved in ZFC.
Domains
computer-science
SAT is NP-complete; complexity theory. Proved in ZFC.
ACM Turing Award 1982. SAT is NP-complete; complexity theory. Proved in ZFC.
computer-science
Canonical: https://axiom.tanaakk.com/proof/cook-turing-1982/