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⊂eq NP (in computer science) erroneously and we prove the justice of the hypotesis J.Edmonds's P≠ 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.