11 citations · 19 across the 6 of their papers we have counts for
Showing 2007Show all
2 papers · 1 filter
cs.SC2007★ 2 cited
Faster polynomial multiplication via multipoint Kronecker substitution
David Harvey
We give several new algorithms for dense polynomial multiplication based on the Kronecker substitution method. For moderately sized input polynomials, the new algorithms improve on…
math.NT2007★ 3 cited
Efficient computation of p-adic heights
David Harvey
We analyse and drastically improve the running time of the algorithm of Mazur, Stein and Tate for computing the canonical cyclotomic p-adic height of a point on an elliptic curve E…