Amortized bivariate multi-point evaluation
From MaRDI portal
Publication:6666534
DOI10.1145/3452143.3465531MaRDI QIDQ6666534
Grégoire Lecerf, Joris van der Hoeven
Publication date: 20 January 2025
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving structured linear systems with large displacement rank
- Newton's method and FFT trading
- On fast multiplication of polynomials over arbitrary algebras
- Fast rectangular matrix multiplication and applications
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Multi-point evaluation in higher dimensions
- Computing syzygies in finite dimension using fast linear algebra
- Faster polynomial multiplication over finite fields using cyclotomic coefficient rings
- Fast multivariate multi-point evaluation revisited
- Polynomial root finding over local rings and application to error correcting codes
- On the complexity exponent of polynomial system solving
- Fast Computation of Shifted Popov Forms of Polynomial Matrices via Systems of Modular Polynomial Equations
- Fast Polynomial Factorization and Modular Composition
- On the Complexity of Multivariate Polynomial Division
- Fast Reduction of Bivariate Polynomials with Respect to Sufficiently Regular Gröbner Bases
- Generic bivariate multi-point evaluation, interpolation and modular composition with precomputation
- Algorithms – ESA 2004
- On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
- Algorithme de Brill-Noether et codes de Goppa
This page was built for publication: Amortized bivariate multi-point evaluation
