Cook–Levin theorem: Satisfiability is $\mathbf{NP}$-complete (Cook 1971, Levin 1973) · Prove2Me

P

Initializing...

Cook–Levin theorem: Satisfiability is $\mathbf{NP}$-complete (Cook 1971, Levin 1973) · Prove2Me