The following pages link to Joris van der Hoeven (Q190427):
Displayed 50 items.
- On the complexity of skew arithmetic (Q260085) (← links)
- Deterministic root finding over finite fields using Graeffe transforms (Q300881) (← links)
- Even faster integer multiplication (Q306687) (← links)
- Toward a model theory for transseries (Q372613) (← links)
- Relaxed algorithms for \(p\)-adic numbers (Q449711) (← links)
- Meta-expansion of transseries (Q629344) (← links)
- Homotopy techniques for multiplication modulo triangular sets (Q651881) (← links)
- Computing with D-algebraic power series (Q669617) (← links)
- Modular composition via factorization (Q722764) (← links)
- Differentially algebraic gaps (Q813313) (← links)
- Computations with effective real numbers (Q817859) (← links)
- Newton's method and FFT trading (Q979146) (← links)
- On asymptotic extrapolation (Q1023265) (← links)
- Fast evaluation of holonomic functions (Q1274814) (← links)
- Operators on generalized power series (Q1347348) (← links)
- On the computation of limsups (Q1358919) (← links)
- Generic asymptotic expansions (Q1389145) (← links)
- Item:Q190427 (redirect page) (← links)
- Shuffle algebra and polylogarithms (Q1591148) (← links)
- FFT-like multiplication of linear differential operators (Q1599537) (← links)
- On the complexity of integer matrix multiplication (Q1635268) (← links)
- The surreal numbers as a universal \(H\)-field (Q1737977) (← links)
- Relax, but don't be too lazy (Q1866999) (← links)
- On the bit-complexity of sparse polynomial and series multiplication (Q1930169) (← links)
- Multi-point evaluation in higher dimensions (Q1938507) (← links)
- Fast computation of generic bivariate resultants (Q1996880) (← links)
- From implicit to recursive equations (Q2002150) (← links)
- Amortized multi-point evaluation of multivariate polynomials (Q2099269) (← links)
- Directed evaluation (Q2192677) (← links)
- Fast amortized multi-point evaluation (Q2238846) (← links)
- Faster polynomial multiplication over finite fields using cyclotomic coefficient rings (Q2274408) (← links)
- Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals (Q2280315) (← links)
- Fast multivariate multi-point evaluation revisited (Q2283121) (← links)
- Accelerated tower arithmetic (Q2338646) (← links)
- Towards semantic mathematical editing (Q2348287) (← links)
- Effective power series computations (Q2420635) (← links)
- Transseries and real differential algebra (Q2431731) (← links)
- Guessing singular dependencies (Q2437325) (← links)
- Effective analytic functions (Q2456553) (← links)
- Counterexamples to witness conjectures (Q2457379) (← links)
- Complexity bounds for zero-test algorithms (Q2457383) (← links)
- Around the numeric-symbolic computation of differential Galois groups (Q2457420) (← links)
- Efficient accelero-summation of holonomic functions (Q2457428) (← links)
- On effective analytic continuation (Q2465577) (← links)
- Generalized power series solutions to linear partial differential equations (Q2469228) (← links)
- New algorithms for relaxed multiplication (Q2469229) (← links)
- On the complexity exponent of polynomial system solving (Q2658549) (← links)
- Integer multiplication in time \(O(n\log n)\) (Q2662018) (← links)
- Constructing reductions for creative telescoping. The general differentially finite case (Q2666962) (← links)
- Overview of the Mathemagix Type System (Q2799572) (← links)