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

2 of 318 comments (clear)

  1. Wow. by Anonymous Coward · · Score: 0, Offtopic

    That's like the worst article ... ever. No information at all.

  2. An easier question by Schiphol · · Score: 0, Offtopic

    We should concentrate on figuring out whether God likes poutine.