A Critique of Keum-Bae Cho's Proof that $\mathrm{P} \subsetneq \mathrm{NP}$
Computational Complexity
2022-05-16 v1
Abstract
In this paper we critique Keum-Bae Cho's proof that . 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 .
Keywords
Cite
@article{arxiv.2104.01736,
title = {A Critique of Keum-Bae Cho's Proof that $\mathrm{P} \subsetneq \mathrm{NP}$},
author = {Benjamin Carleton and Michael C. Chavrimootoo and Conor Taliancich},
journal= {arXiv preprint arXiv:2104.01736},
year = {2022}
}