Cook–Levin theorem — The Logic Path
Node
Cook–Levin theorem (Theorem) in The Logic Path. Era: 1971. Formula: SAT is NP-complete. Origin axiom of path: Huntington's theorem (Boole's Boolean). Modern reach: SAT · NP-completeness · Complexity theory.
Cook–Levin theorem (Theorem) in The Logic Path. Era: 1971. Formula: SAT is NP-complete. Origin axiom of path: Huntington's theorem (Boole's Boolean). Modern reach: SAT · NP-completeness · Complexity theory.
Canonical: https://axiom.tanaakk.com/lineage/logic-path/cook-levin/