Computational Complexity of Sparse Real Algebraic Function Interpolation

Authors:
Dima Grigoriev;Marek Karpinski;Michael F. Singer
Affiliations:
-;-;-
Venue:
Computational Complexity of Sparse Real Algebraic Function Interpolation
Year:
1992

Citing 0
Cited 1

On computing sparse shifts for univariate polynomials

ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We analyze the computational complexity of the problem of interpolating real algebraic functions given by a black box for their evaluations, extending the results of \cite{gks90b,gks91b} on interpolation of sparse rational functions.