2000 character limit reached
A Critique of Keum-Bae Cho's Proof that $\mathrm{P} \subsetneq \mathrm{NP}$
Published 5 Apr 2021 in cs.CC | (2104.01736v1)
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}$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
