Work

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

Year: 2025
Type: preprint
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.
Language: English
Open Access status: gold
OpenAlex ID: W4414938126
Cites:
Cited by:
Related to: