Talk:Shor's algorithm: Difference between revisions

Revision as of 21:16, 8 January 2002

Revision as of 23:55, 8 January 2002

Line 1:

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)^1/3 (log log N)^2/3). I've changed the sentence to claim superpolynomial rather than exponential. --[[LC]]

Okey dokey -- [[CYD]]