DeepAI AI Chat
Log In Sign Up

The Linear Correlation of P and NP

by   Bojin Zheng, et al.

P ?= NP or P vs NP 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 NP. We draw a conclusion that P is linearly dependent and there exists NP which is is linearly independent and take a 3SAT instance which belongs to NP as the example , that is, P ≠ NP.


page 1

page 2

page 3

page 4


Quantified X3SAT: P = NP = PSPACE

This paper shows that P = NP via one-in-three (or exactly-1) 3SAT, and t...

Scheme-theoretic Approach to Computational Complexity I. The Separation of P and NP

We lay the foundations of a new theory for algorithms and computational ...

Numbers Extensions

Over the course of the last 50 years, many questions in the field of com...

Prediction method of cigarette draw resistance based on correlation analysis

The cigarette draw resistance monitoring method is incomplete and single...

Scheme-theoretic Approach to Computational Complexity II. The Separation of P and NP over ℂ, ℝ, and ℤ

We show that the problem of determining the feasibility of quadratic sys...

The Complexity of Plan Existence and Evaluation in Probabilistic Domains

We examine the computational complexity of testing and finding small pla...

A proof of P != NP (New symmetric encryption algorithm against any linear attacks and differential attacks)

P vs NP problem is the most important unresolved problem in the field of...