Randomized Interpolation and Approximation of Sparse Polynomials

Yishay Mansour

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