News for hackers. Stuff that matters.
Re:Donald Knuth making an Earthshaking Announcement June 30 ... by Locke1689 on Sunday April 11, 2010 @11:27PM (#1258315)
No it's not. The factoring problem/RSA problem have never been proven to be NP-complete. Shor's algorithm shows that it's NP, but not NP-complete (or hard). I think it's also in co-NP.
[deleted]
Re:Donald Knuth making an Earthshaking Announcement June 30 ... by PG-13 on Monday April 12, 2010 @12:37AM (#1258414)
Yeah.... but like he said, RSA being in P does not imply that P=NP because RSA has not be shown (and isn't believed) to be NP-complete. If P=NP, then RSA would of course be in P.