论文标题
探索P与NP
Exploring P versus NP
论文作者
论文摘要
在本文中，我们讨论了p是否等于np的问题，我们不遵循许多研究人员的研究线，这是要试图找到这样的问题q，而问题q属于NP complete的类别，如果问题q属于p，p和np是相同的，那么如果问题q不属于p，则p和np是相同的。我们在本文中的研究策略：选择一个Exp-Complete的问题，并将其减少到多项式时间中的NP问题，然后S属于NP，因此Exp = NP，然后从众所周知的P NEQ NP中得出P NEQ NP。
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.
