Randomized interpolation and approximation of sparse polynomials

Yishay Mansour*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


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

Original languageEnglish
Pages (from-to)357-368
Number of pages12
JournalSIAM Journal on Computing
Issue number2
StatePublished - 1995


Dive into the research topics of 'Randomized interpolation and approximation of sparse polynomials'. Together they form a unique fingerprint.

Cite this