Talk:Shor's algorithm: Difference between revisions

Revision as of 11:30, 9 January 2002

Revision as of 15:51, 25 February 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|LC]]

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

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

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

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

OK. It's [[integer factorization]]. --[[LC]]