Slashdot Mirror

← Back to Stories (view on slashdot.org)

No P = NP Proof After All

Posted by CmdrTaco on from the big-o-my-god dept.

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..."

4 of 318 comments (clear)

  1. A better heading by Anonymous Coward · · Score: 3, Funny

    Proof = No Proof

  2. Re:Let me ask a "stupid" question by benjamindees · · Score: 3, Funny

    Solving this problem would save energy on the hundreds of thousands of NSA computers that are currently decrypting all of your e-mail and Skype conversations.

    --
    "I assumed blithely that there were no elves out there in the darkness"
  3. Re:Let me ask a "stupid" question by canajin56 · · Score: 1, Funny

    Yes. Anything but profit that doubles every quarter, forever, is a catastrophic failure.

    --
    ASCII stupid question, get a stupid ANSI
  4. Re:So... by brian0918 · · Score: 3, Funny

    Next the Slashdot story will be used as a Reliable Source on Wikipedia.