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).
Cite
CITATION STYLE
APA
Mansour, Y. (1992). Randomized interpolation and approximation of sparse polynomials. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 623 LNCS, pp. 261–272). Springer Verlag. https://doi.org/10.1007/3-540-55719-9_79
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free