Please create an account to participate in the Slashdot moderation system

 



Forgot your password?
typodupeerror
Math

Submission + - No proof (yet) of P = NP after all->

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..."
Link to Original Source
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:

I have yet to see any problem, however complicated, which, when you looked at it in the right way, did not become still more complicated. -- Poul Anderson

Working...