AI Chat AI Image Generator AI Video Text to Speech

A Critique of Keum-Bae Cho's Proof that P⊊NP

04/05/2021

∙

by Benjamin Carleton, et al.

∙

∙

In this paper we critique Keum-Bae Cho's proof that P⊊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 P⊊NP.

Benjamin Carleton
3 publications
Michael Chavrimootoo
1 publication
Conor Taliancich
3 publications

page 1

page 2

page 3

page 4

research

∙ 11/13/2017

A Refutation of Guinea's "Understanding SAT is in P"

In this work, we summarize and critique the paper "Understanding SAT is ...

0 Jackson Abascal, et al. ∙

research

∙ 03/10/2019

Knowledge compilation languages as proof systems

In this paper, we study proof systems in the sense of Cook-Reckhow for p...

0 Florent Capelli, et al. ∙

research

∙ 06/18/2019

Subsumption-driven clause learning with DPLL+restarts

We propose to use a DPLL+restart to solve SAT instances by successive si...

0 Olivier Bailleux, et al. ∙

research

∙ 01/30/2018

Indistinguishable binomial decision tree of 3-SAT: Proof of class P is a proper subset of class NP

This paper solves a long standing open problem of whether NP-complete pr...

0 Keum-Bae Cho, et al. ∙

research

∙ 09/29/2022

Understanding Interventional TreeSHAP : How and Why it Works

Shapley values are ubiquitous in interpretable Machine Learning due to t...

0 Gabriel Laberge, et al. ∙

research

∙ 04/15/2020

The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability

Satisfiability is considered the canonical NP-complete problem and is us...

0 Thomas Bläsius, et al. ∙

research

∙ 01/17/2023

Calculating lexicase selection probabilities is NP-Hard

Calculating the probability of an individual solution being selected und...

0 Emily Dolson, et al. ∙