Randomized interpolation and approximation of sparse polynomials stPreliminary version

  • Yishay Mansour
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 623)


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


Discrete Fourier Transform Recursive Call Large Coefficient Univariate Polynomial Integer Coefficient 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BOT88]
    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.Google Scholar
  2. [GK87]
    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.Google Scholar
  3. [GKS88]
    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.Google Scholar
  4. [GKS90]
    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.Google Scholar
  5. [GL89]
    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.Google Scholar
  6. [III189]
    Torben Hagerup and Christine Rub. A guided tour to chernoff bounds. Info. Proc. Lett., 33:305–308, 1989.CrossRefGoogle Scholar
  7. [Kar89]
    M. Karpinski. Boolean circuit complexity of algebraic interpolation problems. Technical Report TR-89-027, ICSI, 1989.Google Scholar
  8. [KM91]
    Eyal Kushilevitz and Yishay Mansour. Learning decision trees using the fourier spectrum. In Proceedings of STOC '91, pages 455–464, may 1991.Google Scholar
  9. [Zip79]
    R. E. Zippel. Probabilistic algorithms for sparse polynomials. In EUROSAM, pages 216–226. Springer Lecture notes in computer science, vol. 72, 1979.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Yishay Mansour
    • 1
  1. 1.IBM - T. J. Watson Research CenterYorktown Heights

Personalised recommendations