16 citations · 59 across the 20 of their papers we have counts for
Showing cs.SCShow all
3 papers · 1 filter
cs.SC2023★ 1 cited
Fast interpolation of sparse multivariate polynomials
Joris van der Hoeven, Grégoire Lecerf
Consider a sparse multivariate polynomial f with integer coefficients. Assume that f is represented as a "modular black box polynomial", e.g. via an algorithm to evaluate f at arbi…
cs.SC2023
Factoring sparse polynomials fast
Alexander Demin, Joris van der Hoeven
Consider a sparse polynomial in several variables given explicitly as a sum of non-zero terms with coefficients in an effective field. In this paper, we present several algorithms…
cs.SC2016
Faster integer multiplication using plain vanilla FFT primes
David Harvey, Joris van der Hoeven
Assuming a conjectural upper bound for the least prime in an arithmetic progression, we show that n-bit integers may be multiplied in O(n log n 4^(log^* n)) bit operations.