Interpolation of polynomials given by straight-line programs

Authors:
Sanchit Garg;Éric Schost
Affiliations:
India Institute of Technology, New Delhi, India;Computer Science Department, The University of Western Ontario, London, Ontario, Canada
Venue:
Theoretical Computer Science
Year:
2009

Citing 19
Cited 10

Computing with polynomials given by straight-line programs I: greatest common divisors

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Greatest common divisors of polynomials given by straight-line programs

Journal of the ACM (JACM)
A deterministic algorithm for sparse multivariate polynomial interpolation

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Interpolating polynomials from their values

Journal of Symbolic Computation - Special issue on computational algebraic complexity
Fast parallel algorithms for sparse multivariate polynomial interpolation over finite fields

SIAM Journal on Computing
Modular rational sparse multivariate polynomial interpolation

ISSAC '90 Proceedings of the international symposium on Symbolic and algebraic computation
On fast multiplication of polynomials over arbitrary algebras

Acta Informatica
&egr;-discrepancy sets and their application for interpolation of sparse polynomials

Information Processing Letters
Randomized Interpolation and Approximationof Sparse Polynomials

SIAM Journal on Computing
Modern computer algebra

Modern computer algebra
When Polynomial Equation Systems Can Be "Solved" Fast?

AAECC-11 Proceedings of the 11th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Improved Sparse Multivariate Polynomial Interpolation Algorithms

ISAAC '88 Proceedings of the International Symposium ISSAC'88 on Symbolic and Algebraic Computation
Probabilistic algorithms for sparse polynomials

EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
Early termination in sparse interpolation algorithms

Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases

Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
Symbolic-numeric sparse interpolation of multivariate polynomials

Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Faster integer multiplication

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Change of order for regular chains in positive dimension

Theoretical Computer Science
The matching problem for bipartite graphs with polynomially bounded permanents is in NC

SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science

Fifteen years after DSC and WLSS2 what parallel computations I do today: invited lecture at PASCO 2010

Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
A local decision test for sparse polynomials

Information Processing Letters
Diversification improves interpolation

Proceedings of the 36th international symposium on Symbolic and algebraic computation
Supersparse black box rational function interpolation

Proceedings of the 36th international symposium on Symbolic and algebraic computation
On the bit-complexity of sparse polynomial and series multiplication

Journal of Symbolic Computation
Extracting sparse factors from multivariate integral polynomials

Journal of Symbolic Computation
Sparse polynomial interpolation and Berlekamp/Massey algorithms that correct outlier errors in input values

Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
Structured FFT and TFT: symmetric and lattice polynomials

Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
On Enumerating Monomials and Other Combinatorial Structures by Polynomial Interpolation

Theory of Computing Systems
Recursive sparse interpolation

ACM Communications in Computer Algebra

Quantified Score

Hi-index	5.23

Visualization

Abstract

We give an algorithm for the interpolation of a polynomial A given by a straight-line program. Its complexity is polynomial in @t,log(d),L,n, where @t is an input bound on the number of terms in A, d is a bound on its partial degree in all variables, L is the length of the given straight-line program and n is the number of variables.