Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

CORR
2010
Springer

favoriteEmaildiscussreport

47views Education» more CORR 2010»

An O(M(n) log n) algorithm for the Jacobi symbol

13 years 11 months ago

An O(M(n) log n) algorithm for the Jacobi symbol

Download www.loria.fr

Richard P. Brent, Paul Zimmermann

Real-time Traffic

CORR 2010 | Education |

claim paper

Related Content

» An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps

» An Efficient Algorithm for Row Minima Computations on Basic Reconfigurable Meshes

» Parallel Biological Sequence Comparison Using Prefix Computations

» 3query locally decodable codes of subexponential length

» On the Analysis of Cryptographic Assumptions in the Generic Ring Model

» Experimental Studies of Symbolic ShortestPath Algorithms

» Discrete Symbol Calculus

» The Number of Symbol Comparisons in QuickSort and QuickSelect

» On Symbolic Scheduling Independent Tasks with Restricted Execution Times

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2010
Where	CORR
Authors	Richard P. Brent, Paul Zimmermann

Comments (0)