Sparse Polynomial Interpolation in Nonstandard Bases

In this paper, we consider the problem of interpolating univariate polynomials over a field of characteristic zero that are sparse in (a) the Pochhammer basis or, (b) the Chebyshev basis. The polynomials are assumed to be given by black boxes, i.e., one can obtain the value of a polynomial at any point by querying its black box. We describe efficient new algorithms for these problems. Our algorithms may be regarded as generalizations of Ben-Or and Tiwari's (1988) algorithm (based on the BCH decoding algorithm) for interpolating polynomials that are sparse in the standard basis. The arithmetic complexity of the algorithms is $O(t^2 + t\log d)$ which is also the complexity of the univariate version of the Ben-Or and Tiwari algorithm. That algorithm and those presented here also share the requirement of $2t$ evaluation points.

[1]  Allan Borodin,et al.  On the decidability of sparse univariate polynomial interpolation , 1990, STOC '90.

[2]  A. Dress,et al.  The interpolation problem for k-sparse polynomials and character sums , 1991 .

[3]  Marek Karpinski,et al.  Existence of short proofs for nondivisibility of sparse polynomials under the extended Riemann hypothesis , 1992, ISSAC '92.

[4]  Marek Karpinski,et al.  On Zero-Testing and Interpolation of k-Sparse Multivariate Polynomials Over Finite Fields , 1991, Theor. Comput. Sci..

[5]  Richard Zippel,et al.  Interpolating Polynomials from Their Values , 1990, J. Symb. Comput..

[6]  Erich Kaltofen,et al.  Improved Sparse Multivariate Polynomial Interpolation Algorithms , 1988, ISSAC.

[7]  B. David Saunders,et al.  On computing sparse shifts for univariate polynomials , 1994, ISSAC '94.

[8]  Marek Karpinski,et al.  Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields , 1988, SIAM J. Comput..

[9]  Michael Ben-Or,et al.  A deterministic algorithm for sparse multivariate polynomial interpolation , 1988, STOC '88.

[10]  Moni Naor,et al.  Fast parallel algorithms for chordal graphs , 1987, SIAM J. Comput..

[11]  Marek Karpinski,et al.  The Interpolation Problem for k-sparse Sums of Eigenfunctions of Operators , 1991 .

[12]  Marek Karpinski,et al.  The matching problem for bipartite graphs with polynomially bounded permanents is in NC , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[13]  Marek Karpinski,et al.  Computational Complexity of Sparse Rational Interpolation , 1994, SIAM J. Comput..

[14]  Marek Karpinski,et al.  A Zero-Test and an Interpolation Algorithm for the Shifted Sparse Polynominals , 1993, AAECC.

[15]  T. W. Parks,et al.  Efficient solution of a Toeplitz-plus-Hankel coefficient matrix system of equations , 1980 .

[16]  Rüdiger Loos.  Computing Rational Zeros of Integral Polynomials by p-adic Expansion , 1983, SIAM J. Comput..