88 citations · 270 across the 33 of their papers we have counts for
Showing 2014 · cs.CCShow all
2 papers · 2 filters
cs.CC2014★ 1 cited
Faster polynomial multiplication over finite fields
David Harvey, Joris van der Hoeven, Grégoire Lecerf
Let p be a prime, and let M_p(n) denote the bit complexity of multiplying two polynomials in F_p[X] of degree less than n. For n large compared to p, we establish the bound M_p(n)…
cs.CC2014★ 10 cited
Even faster integer multiplication
David Harvey, Joris van der Hoeven, Grégoire Lecerf
We give a new proof of Fürer's bound for the cost of multiplying n-bit integers in the bit complexity model. Unlike Fürer, our method does not require constructing special coeffici…