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 :**

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

- Introduction to R
- Khan Academy Statistics and Probability
- Mathematics for Machine Learning by Marc Peter Deisenroth, A. Aldo Faisal and Cheng Soon Ong
- Kaggle Learning
- Deep Learning Nanodegree
- Siraj Raval
- How to Win a Data Science Competition on Coursera
- Hands-On Machine Learning with Scikit-Learn and TensorFlow