AI Chat AI Image Generator AI Video Text to Speech

The Linear Correlation of P and NP

03/06/2023

∙

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.

Bojin Zheng
2 publications
Weiwu Wang
1 publication

page 1

page 2

page 3

page 4

research

∙ 12/10/2020

Quantified X3SAT: P = NP = PSPACE

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

0 Latif Salum, et al. ∙

research

∙ 07/06/2021

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 ...

0 Ali Çivril, et al. ∙

research

∙ 11/14/2022

Numbers Extensions

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

0 David O. Zisselman, et al. ∙

research

∙ 04/12/2023

Prediction method of cigarette draw resistance based on correlation analysis

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

0 Linsheng Chen, et al. ∙

research

∙ 07/06/2021

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...

0 Ali Çivril, et al. ∙

research

∙ 02/06/2013

The Complexity of Plan Existence and Evaluation in Probabilistic Domains

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

0 Judy Goldsmith, et al. ∙

research

∙ 02/05/2022

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...

0 Gao Ming, et al. ∙