Jump to content

Talk:Shor's algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by LC~enwiki (talk | contribs) at 21:16, 8 January 2002 (why e^N is wrong). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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 [1] 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


Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Shor%27s_algorithm&oldid=285906"