Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Recurso digital |
| Lingua: | |
| Pubblicazione: |
Zenodo
2023
|
| Accesso online: | https://doi.org/10.5281/zenodo.10370770 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
Sommario:
- <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>