Cook Proposition 1(c): an $\mathbf{NP}$-complete language in $\mathbf{P}$ forces $\mathbf{P} = \mathbf{NP}$

Initializing...

Cook Proposition 1(c): an $\mathbf{NP}$-complete language in $\mathbf{P}$ forces $\mathbf{P} = \mathbf{NP}$ · Prove2Me