16 citations · 59 across the 20 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
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.
math.LO2016
Dimension in the realm of transseries
Matthias Aschenbrenner, Lou van den Dries, Joris van der Hoeven
Let be the differential field of transseries. We establish some basic properties of the dimension of a definable subset of , also in relation to its codi…