Check out my first novel, midnight's simulacra!
Stehlé-Zimmermann algorithm: Difference between revisions
From dankwiki
(Created page with "An algorithm for calculating the http://en.wikipedia.org/wiki/Jacobi_symbol Jacobi symbol of two n-digit numbers in O(lg n M(n)) time, where M(n) is the complexity of a chose...") |
No edit summary |
||
| Line 1: | Line 1: | ||
An algorithm for calculating the | An algorithm for calculating the [http://en.wikipedia.org/wiki/Jacobi_symbol Jacobi symbol] of two n-digit numbers in O(lg n M(n)) time, where M(n) is the complexity of a chosen multiplication algorithm for n-bit numbers. | ||
==See Also== | ==See Also== | ||
Latest revision as of 01:52, 10 September 2011
An algorithm for calculating the Jacobi symbol of two n-digit numbers in O(lg n M(n)) time, where M(n) is the complexity of a chosen multiplication algorithm for n-bit numbers.
See Also
- "An O(M(n) log n)) Algorithm for Calculating the Jacobi Symbol", Brent and Zimmerman, 2010
