Follow Slashdot stories on Twitter

 



Forgot your password?
typodupeerror
Get HideMyAss! VPN, PC Mag's Top 10 VPNs of 2016 for 55% off for a Limited Time ×
Math

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:

Top Ten Things Overheard At The ANSI C Draft Committee Meetings: (8) I'm on the committee and I *still* don't know what the hell #pragma is for.

Working...