3-SAT polynomial time solution? If true then P==NP

Complexity classes

Complexity classes

One of the biggest questions in the CS always was (is) if P==NP, or P!=NP.

I just read a post announcing an article called “Non-Orthodox Combinatorial Models Based on Discordant Structures” by the author V. F. Romanov (http://arxiv.org/abs/1011.3944).

According to the author:

The article presents a constructive proof of effective resolvability of 3-SAT problem, accompanied by description of a polynomial algorithm created for the named purpose.

If this statement is correct, and the algorithm really solves the 3-SAT problem in polynomial time, then P==NP (since 3-SAT is  NP-complete). Although the article, in my opinion, looks too draft for such an important topic, if it will be proven correct, one of the biggest findings in CS will be unveiled.

Lets see..

Leave a Reply