Revision as of 06:02, 14 May 2006 edit Yipdw (talk \| contribs) 240 edits questions on time complexity ← Previous edit		Revision as of 06:03, 14 May 2006 edit undo Yipdw (talk \| contribs) 240 edits No edit summary Next edit →
Line 5: the quantum computer to factors of n..." How does this compare with the O((log n)^3) figure given on the Wikipedia page? I don't believe the expression Shor gives and the expression on the Wikipedia page are equivalent, unless the definitions of ''n'' in use are different, or if Shor is measuring something else. (More importantly, how was the O((log n)^3) figure arrived at?) -[[User:Yipdw\|Yipdw]] 06:02, 14 May 2006 (UTC) ==speed of various classical factoring algorithms==

Talk:Shor's algorithm: Difference between revisions