NP-complete Problems can be Solved and Verified in Polynomial Time
Discuss this preprint
Start a discussion What are Sciety discussions?Listed in
This article is not in any list yet, why not save it to one of your lists.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.