4 citations · 4 across the 3 of their papers we have counts for
Showing cs.SCShow all
3 papers · 1 filter
cs.SC2026
A zero-test for D-algebraic transseries
Shaoshi Chen, Hanqian Fang, Joris van der Hoeven
Consider formal power series that are defined as the solutions of a system of polynomial differential equations together with a sufficient numbe…
cs.SC2025★ 4 cited
Probably faster multiplication of sparse polynomials
Joris van der Hoeven
In this paper, we present a probabilistic algorithm to multiply two sparse polynomials almost as efficiently as two dense univariate polynomials with a result of approximately the…
cs.SC2018
Faster integer multiplication using short lattice vectors
David Harvey, Joris van der Hoeven
We prove that -bit integers may be multiplied in bit operations. This complexity bound had been achieved previously by several authors, assuming va…