This is an outdated version published on 2025-10-08. Read the most recent version.
Preprint / Version 1

NP-complete Problems can be Solved and Verified in Polynomial Time

##article.authors##

DOI:

https://doi.org/10.31224/5533

Keywords:

P versus NP, Theorem proof, Verification

Abstract

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.

Downloads

Download data is not yet available.

Downloads

Posted

2025-10-08

Versions

License

Copyright (c) 2025 Mirzakhmet Syzdykov

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.