A Critique of Keum-Bae Cho's Proof that $\mathrm{P}⊊\mathrm{NP}$

Abstract

In this paper we critique Keum-Bae Cho's proof that $\mathrm{P}⊊\mathrm{NP}$. This proof relates instances of 3-SAT to indistinguishable binomial decision trees and claims that no polynomial-time algorithm can solve 3-SAT instances represented by these trees. We argue that their proof fails to justify a crucial step, and so the proof does not establish that $\mathrm{P}⊊\mathrm{NP}$.

References in corpus (1)

• Indistinguishable binomial decision tree of 3-SAT: Proof of class P is a proper subset of class NP