Evaluating Polynomials at Fixed Sets of Points

Cited In (27)

On arithmetical algorithms over finite fields
On the complexity of skew arithmetic
Fast Hermite interpolation and evaluation over finite fields of characteristic two
An efficient algorithm for multivariate Maclaurin-Newton transformation
On Matrices With Displacement Structure: Generalized Operators and Faster Algorithms
Genus 2 point counting over prime fields
On the complexities of multipoint evaluation and interpolation
A point counting algorithm using cohomology with compact support
On the complexity of algorithms for the translation of polynomials
Symbolic treatment of geometric degeneracies
Sequential and parallel complexity of approximate evaluation of polynomial zeros
Conformal mapping in linear time
Fast evaluation and interpolation at the Chebyshev sets of points
Polynomial evaluation and interpolation on special sets of points
Implementing the Tangent Graeffe Root Finding Method
Algebraic complexity of computing polynomial zeros
Fast multidimensional Bernstein-Lagrange algorithms
Matrix identities of the fast Fourier transform
Nearly optimal computations with structured matrices
A new approach to fast polynomial interpolation and multipoint evaluation
Fast computation of special resultants
Homotopy techniques for multiplication modulo triangular sets
Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros
Polynomial division and its computational complexity
Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.
Selection of good algorithms from a family of algorithms for polynomial derivative evaluation
Fast systematic encoding of multiplicity codes

This page was built for publication: Evaluating Polynomials at Fixed Sets of Points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4091364)