Talk:Shor's algorithm: Difference between revisions

Revision as of 22:27, 3 March 2002

Revision as of 23:47, 31 March 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. --[[user:LC|LC]]

Okey dokey. You might want to make a wiki node on that. -- [[user:CYD|CYD]]

OK. It's [[:integer factorization|integer factorization]]. --[[user:LC|LC]]

Thanks! -- [[user:CYD|CYD]]