Proof of the hypothesis Edmonds's, not polynomial of NPC-problems and classification of the problems with polynomial certificates
Computational Complexity
2013-03-12 v1
Abstract
We show that the affirmation (in computer science) erroneously and we prove the justice of the hypotesis J.Edmonds's . We show further that all the -complete problems is not polynomial and we give the classification of the problems with the polynomial certificates.
Keywords
Cite
@article{arxiv.1303.2580,
title = {Proof of the hypothesis Edmonds's, not polynomial of NPC-problems and classification of the problems with polynomial certificates},
author = {B. S. Kochkarev},
journal= {arXiv preprint arXiv:1303.2580},
year = {2013}
}
Comments
4 pages