activity
20092025
most citedOn the bit-complexity of sparse polynomial multiplication

11 citations · 26 across the 8 of their papers we have counts for

collaborators

9 papers

cs.CC2025

Integer multiplication is at least as hard as matrix transposition

David Harvey, Joris van der Hoeven

Working in the multitape Turing model, we show how to reduce the problem of matrix transposition to the problem of integer multiplication. If transposing an binary mat…

math.LO2021

On a Differential Intermediate Value Property

Matthias Aschenbrenner, Lou van den Dries, Joris van der Hoeven

Liouville closed -fields are ordered differential fields whose ordering and derivation interact in a natural way and where every linear differential equation of order has a…

math.LO2019

Hardy fields, the intermediate value property, and -freeness

Matthias Aschenbrenner, Lou van den Dries, Joris van der Hoeven

We discuss the conjecture that every maximal Hardy field has the Intermediate Value Property for differential polynomials, and its equivalence to the statement that all maximal Har…

cs.SC2019

LU factorization with errors *

Jean-Guillaume Dumas, Joris Van Der Hoeven, Clément Pernet +1

We present new algorithms to detect and correct errors in the lower-upper factorization of a matrix, or the triangular linear system solution, over an arbitrary field. Our main alg…

math.LO2018

Logarithmic Hyperseries

Lou van den Dries, Joris van der Hoeven, Elliot Kaplan

We define the field of logarithmic hyperseries, construct on natural operations of differentiation, integration, and composition, establish the basic prop…

math.LO2017

On numbers, germs, and transseries

Matthias Aschenbrenner, Lou van den Dries, Joris van der Hoeven

Germs of real-valued functions, surreal numbers, and transseries are three ways to enrich the real continuum by infinitesimal and infinite quantities. Each of these comes with natu…