Proof of Millennium Theorem "P versus NP"

Fuente: Zenodo
Enregistré dans:
Détails bibliographiques
Auteur principal: Syzdykov, Mirzakhmet
Format: Recurso digital
Publié: Zenodo 2023
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866901960264777728
author Syzdykov, Mirzakhmet
author_facet Syzdykov, Mirzakhmet
contents <p>We go on towards the proof of concept of Millennium Theorem proposed by Stephen Cook, we state that polynomial classes and its successors like non-polynomial (NP) are equal along the function equilibrium which is justified by the parallel processing law, we will also give the exact algorithm to Traveling Salesman Problem (TSP) which is computed in the polynomial complexity time of the product of linear and logarithmic operands, the linear algorithm for the maximum flow problem is also given.</p>
format Recurso digital
id zenodo_https___doi_org_10_5281_zenodo_10370770
institution Zenodo
language
publishDate 2023
publisher Zenodo
record_format zenodo
spellingShingle Proof of Millennium Theorem "P versus NP"
Syzdykov, Mirzakhmet
<p>We go on towards the proof of concept of Millennium Theorem proposed by Stephen Cook, we state that polynomial classes and its successors like non-polynomial (NP) are equal along the function equilibrium which is justified by the parallel processing law, we will also give the exact algorithm to Traveling Salesman Problem (TSP) which is computed in the polynomial complexity time of the product of linear and logarithmic operands, the linear algorithm for the maximum flow problem is also given.</p>
title Proof of Millennium Theorem "P versus NP"
url https://doi.org/10.5281/zenodo.10370770