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.