Keum-Bae Cho’s proof relates instances of 3-SAT to indistinguishablebinomial decision trees and claims that no polynomial-time algorithm can solve these trees . We argue that their proof fails tojustify a crucial step, and so the proof does not establish that $\mathrm{P} \subsetneq \mathrm {NP}$.

Author(s) : Benjamin Carleton, Michael Chavrimootoo, Conor Taliancich

Links : PDF - Abstract

Code :
Coursera

Keywords : proof - mathrm - bae - cho - np -

Leave a Reply

Your email address will not be published. Required fields are marked *