Abstract
We present a randomized algorithm that interpolates a sparse polynomial in polynomial time in the bit complexity model. The algorithm can be also applied to approximate polynomials that can be approximated by sparse polynomials (the approximation is in the L2 norm).
Part of the research done while the author was at Aiken Computation Laboratory, Harvard University, Cambridge Ma
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
M. Ben-Or and P. Tiwari. A deterministic algorithm for sparse multivaiiate polynomial interpolation. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pages 301–309, May 1988.
D. Y. Grigoriev and M. Karpinski. The matching problem for bipartite graphs with polynomially bounded permanents is in nc. In 28th Annual Symposium on Foundations of Computer Science, Los Angeles, California, pages 166–172, October 1987.
D, Y. Grigoriev, M. Karpinski, and M. Singer. Fast parallel algorithms for sparse multivariate polynomial interpolation over finite fields. Technical Report Research report no. 8523-CS, University of Bonn, 1988. to appear in Siam J. on Comp.
D. Y. Grigoriev, M. Karpinski, and M. Singer. Interpolation of sparse rational functions without knowing bounds on exponents. In 31th Annual Symposium on Foundations of Computer Science, St. Louis, pages 840–846, October 1990.
O. Goldreich and L. Levin. A hard-core predicate for all one-way functions. In Proc. 21 st ACM Symposium on Theory of Computing, pages 25–32. ACM, 1989.
Torben Hagerup and Christine Rub. A guided tour to chernoff bounds. Info. Proc. Lett., 33:305–308, 1989.
M. Karpinski. Boolean circuit complexity of algebraic interpolation problems. Technical Report TR-89-027, ICSI, 1989.
Eyal Kushilevitz and Yishay Mansour. Learning decision trees using the fourier spectrum. In Proceedings of STOC '91, pages 455–464, may 1991.
R. E. Zippel. Probabilistic algorithms for sparse polynomials. In EUROSAM, pages 216–226. Springer Lecture notes in computer science, vol. 72, 1979.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mansour, Y. (1992). Randomized interpolation and approximation of sparse polynomials stPreliminary version. In: Kuich, W. (eds) Automata, Languages and Programming. ICALP 1992. Lecture Notes in Computer Science, vol 623. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55719-9_79
Download citation
DOI: https://doi.org/10.1007/3-540-55719-9_79
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55719-7
Online ISBN: 978-3-540-47278-0
eBook Packages: Springer Book Archive