NPC问题的Edmonds非多项式假设的证明及多项式证明问题的分类
Proof of the hypothesis Edmonds's, not polynomial of NPC-problems and classification of the problems with polynomial certificates
摘要：
本文指出了计算机科学中的$P\subseteq NP$的断言是错误的，并证明了J.Edmonds的$P\neq NP$的假设是正确的.进一步证明了所有的$NP$ -完全问题都不是多项式的，并给出了多项式证书问题的分类。
英文摘要：
We show that the affirmation $P\subseteq NP$ (in computer science) erroneously and we prove the justice of the hypotesis J.Edmonds's $P\neq NP$. We show further that all the $NP$-complete problems is not polynomial and we give the classification of the problems with the polynomial certificates.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
