Want to read Slashdot from your mobile device? Point it at m.slashdot.org and keep reading!


Forgot your password?
Back for a limited time - Get 15% off sitewide on Slashdot Deals with coupon code "BLACKFRIDAY" (some exclusions apply)". ×

Submission + - No proof (yet) of P = NP after all (wordpress.com)

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..."
This discussion was created for logged-in users only, but now has been archived. No new comments can be posted.

No proof (yet) of P = NP after all

Comments Filter:

Many people are unenthusiastic about their work.