Home > slashdot > Polynomial Time Code For 3-SAT Released, P==NP

Polynomial Time Code For 3-SAT Released, P==NP

January 20th, 2011 01:35 admin Leave a comment Go to comments

An anonymous reader writes “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. Note that there are already algorithms to solve 3-SAT, including one that runs in time (4/3)^n and succeeds with high probability. Incidentally, this wouldn’t necessarily imply that encryption is worthless: it may still be too slow to be practical.”

Source: Polynomial Time Code For 3-SAT Released, P==NP

Related Articles:

  1. HDCP Encryption/Decryption Code Released
  2. Samsung Galaxy Note II Source Code Released
  3. Return To Castle Wolfenstein Source Code Released
  4. Castle Wolfenstein Source Code Released
  5. 21st IOCCC Source Code Released
blog comments powered by Disqus