Re: Factoring - State of the Art and Predictions
17 Dec
2003
17 Dec
'03
11:17 p.m.
At 8:19 PM 02/12/95, Matt Blaze wrote:
No it hasn't. Factoring is believed to be hard, but no one has ever shown it to be NP-hard (let alone NP complete).
Woops. Thanks for the correction, and thanks to everyone else who managed to correct me within only minutes after I made the mistake. :) You can all stop sending me mail now. [Moral of the story: don't make a math error on the cypherpunks list.]
8243
Age (days ago)
8243
Last active (days ago)
0 comments
1 participants
participants (1)
-
jrochkin@cs.oberlin.edu