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 [GKS 90b, GKS 91b] on interpolation of sparse rational functions.
Supported in part by Leibniz Center for Research in Computer Science, by the DFG, Grant KA 673/4–1 and by the SERC Grant GR-E 68297
Supported in part by NSF Grant DMS-9024624
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bochnak, J., Coste, M., and Roy, M. F., Géométrie algebrique réelle, Springer-Verlag, 1987.
Ben-Or, M., Tiwari, P., A deterministic algorithm for sparse multivariate polynomial interpolation, Proc. STOC ACM, 1988, pp. 301–309.
Blum, L., Shub, M., and Smale, S., On a theory of computation over the real numbers; NP completeness, recursive functions and universal machines, Proc. IEEE FOCS, 1988, pp. 387–397.
Dold, A., Lectures on algebraic topology, Springer-Verlag, 1980.
Eilenberg, S., and Steenrod, N., Foundation of algebraic topology, Princeton, 1952.
Grigoriev, D., Karpinski, M., and Odlyzko, A., Nondivisibility of sparse polynomials is in NP under the Extended Riemann Hypothesis, Preprint Max-Planck-Institute für Mathematik N6, 1991; to appear in J. AAECC 3 (1992).
Grigoriev. D., Karpinski, M., and Singer, M., Fast parallel algorithms for sparse multivariate polynomial interpolation over finite fields, SIAM J. Comput., 1990, v. 19, N6, pp.1059–1063.
Grigoriev. D., Karpinski, M., and Singer, M., Interpolation of sparse rational functions without knowing bounds on exponents, Proc. IEEE FOCS, 1990, pp. 840–847.
Grigoriev. D., Karpinski, M., and Singer, M., The interpolation problem for k-sparse sums of eigenfunctions of operators, Adv. Appl. Math., 1991, v. 12, pp.76–81.
Grigoriev, D., Karpinski, M., and Singer, M., Computational complexity of sparse rational interpolation, submitted to SIAM J. Comput.
Grigoriev, D., Vorobjov, N. (Jr.), Solving systems of polynomial inequalities in subexponential time, J. Symb. Comput., 1988, v. 5, pp. 37–64.
Heintz, J., Roy, M. F., Solerno, P., Sur la complexité du principe de Tarski-Seidenberg, Bull. Soc. Math. France, 1990, 118, pp. 101–126.
Kolchin, E., Differential algebra and algebraic groups, Academic Press, 1973.
Khovanskii, A., Fewmonomials, Transl. Math. Monogr., AMS 88, 1991.
Milnor, J., On the Betti numbers of real varieties, Proc. AMS 15, 1964, pp. 275–280.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Birkhäuser Boston
About this paper
Cite this paper
Grigoriev, D., Karpinski, M., Singer, M. (1993). Computational Complexity of Sparse Real Algebraic Function Interpolation. In: Eyssette, F., Galligo, A. (eds) Computational Algebraic Geometry. Progress in Mathematics, vol 109. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-2752-6_7
Download citation
DOI: https://doi.org/10.1007/978-1-4612-2752-6_7
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4612-7652-4
Online ISBN: 978-1-4612-2752-6
eBook Packages: Springer Book Archive