Proof of the hypothesis Edmonds's, not polynomial of NPC-problems and classification of the problems with polynomial certificates

Abstract

We show that the affirmation $P\subseteq NP$ (in computer science) erroneously and we prove the justice of the hypotesis J.Edmonds's $P\ne 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.

4 pages

References in corpus (1)

• About one class polynomial problems with not polynomial certificates