''Polynomial Time Code For 3-SAT Released, P==NP.
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.
'' [source, here, 3-sat cod here]
Article here.
Saturday, January 22, 2011
New claim that P==NP
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment