“Vladimir Romanov has released what he claims is a polynomial-time algorithm for solving 3-SAT. Because 3-SAT is NP-complete, this would imply that P==NP. While there’s still good reason to be skeptical that this is, in fact, true, he’s made source code available and appears decidedly more serious than most of the people attempting to prove that P==NP or P!=NP. Even though this is probably wrong, just based on the sheer number of prior failures, it seems more likely to lead to new discoveries than most.
Beaucoup de commentaires sur slashdot semblent indiquer que le probleme a ete simplifie et que meme si le code fonctionnait en P, ceci n’impliquerait pas que P==NP.