On the complexities of multipoint evaluation and interpolation

Authors:
Alin Bostan;Éric Schost
Affiliations:
Laboratoire STIX, Departement d' Informatique, École polytechnique, 91128 Palaiseau Cedex, France;Laboratoire STIX, Departement d' Informatique, École polytechnique, 91128 Palaiseau Cedex, France
Venue:
Theoretical Computer Science
Year:
2004

Citing 15
Cited 2

A deterministic algorithm for sparse multivariate polynomial interpolation

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
SIMP (Single Instruction stream/Multiple instruction Pipelining): a novel high-speed single-processor architecture

ISCA '89 Proceedings of the 16th annual international symposium on Computer architecture
Solving systems of nonlinear polynomial equations faster

ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Interpolating polynomials from their values

Journal of Symbolic Computation - Special issue on computational algebraic complexity
On fast multiplication of polynomials over arbitrary algebras

Acta Informatica
Polynomial and matrix computations (vol. 1): fundamental algorithms

Polynomial and matrix computations (vol. 1): fundamental algorithms
Fast algorithms with preprocessing for matrix-vector multiplication problems

Journal of Complexity
Modern computer algebra

Modern computer algebra
Challenges of symbolic computation: my favorite open problems

Journal of Symbolic Computation
Structured matrices and polynomials: unified superfast algorithms

Structured matrices and polynomials: unified superfast algorithms
Improved Sparse Multivariate Polynomial Interpolation Algorithms

ISAAC '88 Proceedings of the International Symposium ISSAC'88 on Symbolic and Algebraic Computation
Polynomial evaluation via the division algorithm the fast Fourier transform revisited

STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Chinese remainder and interpolation algorithms

SYMSAC '71 Proceedings of the second ACM symposium on Symbolic and algebraic manipulation
Tellegen's principle into practice

ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Computing Elementary Symmetric Polynomials with a Subpolynomial Number of Multiplications

SIAM Journal on Computing

Multivariate power series multiplication

Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Fast arithmetic for triangular sets: From theory to practice

Journal of Symbolic Computation

Quantified Score

Hi-index	5.23

Visualization

Abstract

We compare the complexities of multipoint polynomial evaluation and interpolation. We show that, over a field of characteristic zero, both questions have equivalent complexities, up to a constant number of polynomial multiplications.