Interpolation of sparse rational functions without knowing bounds on exponents

The authors present the first algorithm for the (black box) interpolation of t-sparse, n-variate, rational functions without knowing bounds on exponents of their sparse representation, with the number of queries independent of exponents. In fact, the algorithm uses O(nt/sup t/) queries to the black box, and it can be implemented for a fixed t in a polynomially bounded storage (or polynomial parallel time).<<ETX>>

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

[2]  K. Ramachandra,et al.  Vermeidung von Divisionen. , 1973 .

[3]  R. Evans,et al.  Generalized Vandermonde determinants and roots of unity of prime order , 1976 .

[4]  R. Loos.  Generalized Polynomial Remainder Sequences , 1983 .

[5]  Erich Kaltofen,et al.  Computing with Polynomials Given By Black Boxes for Their Evaluations: Greatest Common Divisors, Factorization, Separation of Numerators and Denominators , 1990, J. Symb. Comput..

[6]  O. Ore.  Theory of Non-Commutative Polynomials , 1933 .

[7]  J. Hopcroft,et al.  Fast parallel matrix and GCD computations , 1982, FOCS 1982.

[8]  Stephen A. Cook,et al.  A Taxonomy of Problems with Fast Parallel Algorithms , 1985, Inf. Control..

[9]  Allan Borodin,et al.  Fast parallel matrix and GCD computations , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

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

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

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

[13]  Marek Karpinski,et al.  VC Dimension and Learnability of Sparse Polynomials and Rational Functions , 1989 .

[14]  Richard M. Karp,et al.  A Survey of Parallel Algorithms for Shared-Memory Machines , 1988 .

[15]  Dima Grigoriev,et al.  Solving Systems of Polynomial Inequalities in Subexponential Time , 1988, J. Symb. Comput..

[16]  Erich Kaltofen,et al.  Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[17]  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).

[18]  Ketan Mulmuley,et al.  A fast parallel algorithm to compute the rank of a matrix over an arbitrary field , 1986, STOC '86.

[19]  Erich Kaltofen,et al.  Uniform closure properties of P-computable functions , 1986, STOC '86.