Levin's theorem (NP-completeness) — The Logic Path
Node
Levin's theorem (NP-completeness) (Theorem) in The Logic Path. Era: 1973. Formula: SAT is NP-complete. Origin axiom of path: Huntington's theorem (Boole's Boolean). Modern reach: SAT · NP-completeness · Complexity theory.