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.
[ Parent
| on HN ]
[deleted]