The Linear Correlation of $P$ and $NP$

Bojin Zheng; Weiwu Wang

paper

The Linear Correlation of $P$ and $N P$

arXiv:2303.03958

Abstract

$P = ? N P$ or $P v s N P$ is the core problem in computational complexity theory. In this paper, we proposed a definition of linear correlation of derived matrix and system, and discussed the linear correlation of $P$ and $N P$ . We draw a conclusion that $P$ is linearly dependent and there exists $N P$ which is is linearly independent and take a 3SAT instance which belongs to $N P$ as the example , that is, $P \neq = N P$ .

The Linear Correlation of P and NP

Abstract

The Linear Correlation of $P$ and $N P$