Computational Complexity of Sparse Real Algebraic Function Interpolation
Dima Grigoriev, Marek Karpiński, Michael F. Singer · Birkhäuser Boston eBooks · 1993
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 [GKS 90b, GKS 91b] on interpolation of sparse rational functions. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.