9 citations · 20 across the 10 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2010★ 4 cited
An O(M(n) log n) algorithm for the Jacobi symbol
Richard P. Brent, Paul Zimmermann
The best known algorithm to compute the Jacobi symbol of two n-bit integers runs in time O(M(n) log n), using Schönhage's fast continued fraction algorithm combined with an identit…
cs.DS2010
Modern Computer Arithmetic (version 0.5.1)
Richard P. Brent, Paul Zimmermann
This is a draft of a book about algorithms for performing arithmetic, and their implementation on modern computers. We are concerned with software more than hardware - we do not co…
cs.DS2007★ 1 cited
A Multi-level Blocking Distinct Degree Factorization Algorithm
Richard Brent, Paul Zimmermann
We give a new algorithm for performing the distinct-degree factorization of a polynomial P(x) over GF(2), using a multi-level blocking strategy. The coarsest level of blocking repl…