B. S. Kochkarev

most citedAbout one class polynomial problems with not polynomial certificates

2 citations · 3 across the 3 of their papers we have counts for

collaborators

Showing cs.CCShow all

1 paper · 1 filter

cs.CC2013★ 1 cited

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

B. S. Kochkarev

We show that the affirmation $P \subseteq N P$ (in computer science) erroneously and we prove the justice of the hypotesis J.Edmonds's $P \neq = N P$ . We show further that all the $N P$ -c…