NP-complete Problems can be Solved and Verified in Polynomial Time
Fuente:
Zenodo
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Recurso digital |
| Pubblicazione: |
Zenodo
2025
|
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866901343139004416 |
|---|---|
| author | Syzdykov, Mirzakhmet |
| author_facet | Syzdykov, Mirzakhmet |
| contents | <p><span><span><span>In this short paper we give the final resolution of “P versus NP” theorem according to our previous results obtained in the field of automaton implementation for extended regular expressions and generally intersection operator.</span></span></span></p> |
| format | Recurso digital |
| id | zenodo_https___doi_org_10_5281_zenodo_17267018 |
| institution | Zenodo |
| language | |
| publishDate | 2025 |
| publisher | Zenodo |
| record_format | zenodo |
| spellingShingle | NP-complete Problems can be Solved and Verified in Polynomial Time Syzdykov, Mirzakhmet <p><span><span><span>In this short paper we give the final resolution of “P versus NP” theorem according to our previous results obtained in the field of automaton implementation for extended regular expressions and generally intersection operator.</span></span></span></p> |
| title | NP-complete Problems can be Solved and Verified in Polynomial Time |
| url | https://doi.org/10.5281/zenodo.17267018 |