activity
20142025
most citedIndistinguishable binomial decision tree of 3-SAT: Proof of class P is a proper subset of class NP

2 citations · 3 across the 3 of their papers we have counts for

collaborators
Showing 2014 · cs.CCShow all

1 paper · 2 filters

cs.CC2014★ 1 cited

The number system hidden inside the Boolean satisfiability problem

Keum-Bae Cho

This paper gives a novel approach to analyze SAT problem more deeply. First, I define new elements of Boolean formula such as dominant variable, decision chain, and chain coupler.…