Content deleted Content added
Line 30:
By my understanding, the case is (a)? --[[User:141.233.176.14|141.233.176.14]] 16:02, 30 April 2007 (UTC)
==
The article said the best classical factoring algorithms are O(e^N). The author presumably meant theta rather than O. The General Number Field Sieve [http://citeseer.nj.nec.com/398050.html] is significantly faster than that, with a running time of theta(exp(((64/9)*log N)<sup>1/3</sup> (log log N)<sup>2/3</sup>). I've changed the sentence to claim superpolynomial rather than exponential. --[[user:LC|LC]]
| |||