Polynomial-Time Solvability of SAT Implies $\mathrm{P}=\mathrm{NP}$ - Androma

Polynomial-Time Solvability of SAT Implies $\mathrm{P}=\mathrm{NP}$

Polynomial-Time Solvability of SAT Implies $\mathrm{P}=\mathrm{NP}$

No pull requests yet

Pull requests let you propose changes to this theorem's content.

Create Pull Request