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

TL;DR

This paper argues that P is not equal to NP, refutes the common belief, and classifies problems with polynomial certificates, claiming all NP-complete problems are not polynomial.

Contribution

It provides a proof that P does not equal NP and offers a classification of problems based on their polynomial certificates, challenging established complexity theory.

Findings

P is not equal to NP according to the paper

All NP-complete problems are not polynomial

A new classification of problems with polynomial certificates

Abstract

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.