Amortized bivariate multi-point evaluation
From MaRDI portal
Cites work
- Algorithme de Brill-Noether et codes de Goppa
- Algorithms – ESA 2004
- Computing syzygies in finite dimension using fast linear algebra
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Fast computation of shifted Popov forms of polynomial matrices via systems of modular polynomial equations
- Fast multivariate multi-point evaluation revisited
- Fast polynomial factorization and modular composition
- Fast rectangular matrix multiplication and applications
- Fast reduction of bivariate polynomials with respect to sufficiently regular Gröbner bases
- Faster polynomial multiplication over finite fields using cyclotomic coefficient rings
- Generic bivariate multi-point evaluation, interpolation and modular composition with precomputation
- scientific article; zbMATH DE number 3935185 (Why is no real title available?)
- scientific article; zbMATH DE number 976329 (Why is no real title available?)
- scientific article; zbMATH DE number 1936673 (Why is no real title available?)
- Multi-point evaluation in higher dimensions
- Newton's method and FFT trading
- On fast multiplication of polynomials over arbitrary algebras
- On the complexity exponent of polynomial system solving
- On the complexity of multivariate polynomial division
- On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
- Polynomial root finding over local rings and application to error correcting codes
- Solving structured linear systems with large displacement rank
This page was built for publication: Amortized bivariate multi-point evaluation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6666534)
