NP-complete Problems can be Solved and Verified in Polynomial Time
Mirzakhmet Syzdykov · 2025
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.