2000 character limit reached
A Critique of Keum-Bae Cho's Proof that $\mathrm{P} \subsetneq \mathrm{NP}$ (2104.01736v1)
Published 5 Apr 2021 in cs.CC
Abstract: In this paper we critique Keum-Bae Cho's proof that $\mathrm{P} \subsetneq \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} \subsetneq \mathrm{NP}$.