Exploring P versus NP
Abstract
In this article, we discuss the question of whether P equals NP, we do not follow the line of research of many researchers, which is to try to find such a problem Q, and the problem Q belongs to the class of NP-complete, if the problem Q is proved to belong to P, then P and NP are the same, if the problem Q is proved not to belong to P, then P and NP are separated. Our research strategy in this article: Select a problem S of EXP-complete and reduce it to a problem of NP in polynomial time, then S belongs to NP, so EXP = NP, and then from the well-known P neq NP, derive P neq NP.
Cite
@article{arxiv.2209.15410,
title = {Exploring P versus NP},
author = {Jian-Gang Tang},
journal= {arXiv preprint arXiv:2209.15410},
year = {2024}
}
Comments
In the recently submitted version titled "Exploring P versus NP," meticulous annotations have been incorporated for each theorem conclusion in the original manuscript. The primary objective of these annotations is to enhance readers' comprehension and readability of the theorem conclusions