arXiv Open Access 2013

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

B. S. Kochkarev

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.CC

Penulis (1)

B. S. Kochkarev

Format Sitasi

APA MLA BibTeX

Kochkarev, B.S. (2013). Proof of the hypothesis Edmonds's, not polynomial of NPC-problems and classification of the problems with polynomial certificates. https://arxiv.org/abs/1303.2580

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2013
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓