Content deleted Content added
Archimerged (talk | contribs) →Did anyone ever check this?: why I added {fact} |
m Another question about time complexity |
||
Line 93:
:I added {fact} after changing an N to a Q because I'm not sure in that case if the change is correct. Probably the correct citation is Shor's paper but it must be checked.
:[[User:Archimerged|Archimerged]] 03:30, 10 April 2007 (UTC)
== Another question about time complexity ==
The intro says:
:"''Shor's algorithm is a quantum algorithm for factoring a number N in O((log N)<sup>3</sup>) time''"
and then says:
:"''One way to crack RSA encryption is by factoring N ... Shor's algorithm can crack RSA in polynomial time''"
Are these two quotes not contradictory? [[User:Oli Filth|Oli Filth]] 18:26, 17 April 2007 (UTC)
| |||