Home > slashdot > No P = NP Proof After All

No P = NP Proof After All

February 28th, 2011 02:38 admin Leave a comment Go to comments


00_NOP writes “Internet commerce seems safe for now as Russian computer scientist Vladimir Romanov has conceded that his previously published solution to the ’3 SAT’ problem of boolean algebra does not work. If his solution did work it would have shown that many problems thought to be unsolvable with conventional computers — including decrypting your HTTPS encoded credit card number — would have been solvable in polynominal time. Romanov, who is very far from the sort of crank who normally claims to have proved P = NP or the opposite, is not giving up though…”

Source: No P = NP Proof After All

Related Articles:

  1. Possible Proof of ABC Conjecture
  2. Possible Proof of ABC Conjecture
  3. Collatz Proof Proposed: Hailstone Sequences End In 1
  4. Claimed Proof That P != NP
  5. Facebook: We Have Proof Ceglia’s Contract Is Fake
blog comments powered by Disqus