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

01/30/2018
by   Keum-Bae Cho, et al.
0

This paper solves a long standing open problem of whether NP-complete problems could be solved in polynomial time on a deterministic Turing machine by showing that the indistinguishable binomial decision tree can be formed in a 3-SAT instance. This paper describes how to construct the decision tree and explains why 3-SAT has no polynomial-time algorithm when the decision tree is formed in the 3-SAT instance. The indistinguishable binomial decision tree consists of polynomial numbers of nodes containing an indistinguishable variable pair but generates exponentially many paths connecting the clauses to be used for sequences of resolution steps. The number of paths starting from the root node and arriving at a child node forms a binomial coefficient. In addition, each path has an indistinguishable property from one another. Due to the exponential number of paths and their indistinguishability, if an indistinguishable binomial decision tree is constructed in which there exist one or more paths generating an empty clause, the number of calculation steps needed to extract the empty clause is not polynomially bounded. This result leads to the conclusion that class P is a proper subset of class NP.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

03/27/2018

Non-Interlaced SAT is in P

We investigate the NP-Complete problem SAT and the geometry of its insta...
02/01/2018

On Polynomial time Constructions of Minimum Height Decision Tree

In this paper we study a polynomial time algorithms that for an input A⊆...
04/05/2021

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

In this paper we critique Keum-Bae Cho's proof that P⊊NP. This proof rel...
04/12/2019

Learning Optimal Decision Trees from Large Datasets

Inferring a decision tree from a given dataset is one of the classic pro...
10/27/2020

GPUTreeShap: Fast Parallel Tree Interpretability

SHAP (SHapley Additive exPlanation) values provide a game theoretic inte...
04/14/2005

The Combined Technique for Detection of Artifacts in Clinical Electroencephalograms of Sleeping Newborns

In this paper we describe a new method combining the polynomial neural n...
11/03/2021

Effective guessing has unlikely consequences

A classic result of Paul, Pippenger, Szemerédi and Trotter states that D...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.