11 citations · 19 across the 2 of their papers we have counts for
2 papers
cs.DS2009★ 11 cited
On the bit-complexity of sparse polynomial multiplication
Joris van der Hoeven, Grégoire Lecerf
In this paper, we present fast algorithms for the product of two multivariate polynomials in sparse representation. The bit complexity of our algorithms are studied in detail for v…
cs.SC2009★ 8 cited
Homotopy methods for multiplication modulo triangular sets
Alin Bostan, Muhammad Chowdhury, Joris van der Hoeven +1
We study the cost of multiplication modulo triangular families of polynomials. Following previous work by Li, Moreno Maza and Schost, we propose an algorithm that relies on homotop…