  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.
