Interpolation of sparse rational functions without knowing bounds on exponents

Authors:
D. Y. Grigoriev;M. Karpinski;M. F. Singer
Affiliations:
Steklov Inst. of Math., Acad. of Sci., Lenningrad, USSR;-;-
Venue:
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Year:
1990

Citing 0
Cited 3

A local decision test for sparse polynomials

Information Processing Letters
Sparse interpolation of multivariate rational functions

Theoretical Computer Science
Short Proofs for Nondivisibility of Sparse Polynomials under the Extended Riemann Hypothesis

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

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).