Randomized Interpolation and Approximation of Sparse Polynomials (1995)
by
Yishay Mansour
| Venue: | SIAM Journal on Computing |
| Citations: | 35 - 1 self |
BibTeX
@ARTICLE{Mansour95randomizedinterpolation,
author = {Yishay Mansour},
title = {Randomized Interpolation and Approximation of Sparse Polynomials},
journal = {SIAM Journal on Computing},
year = {1995},
volume = {24},
pages = {357--368}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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 L_2 norm).
Citations
| 292 | L.: A Hard-Core Predicate for all One-Way Functions - Goldreich, Levin - 1989 |
| 193 | Probabilistic algorithms for sparse polynomials, in: Symbolic and algebraic computation - Zippel - 1979 |
| 190 | A guided tour of Chernoff bounds - Hagerup, Rub - 1990 |
| 155 | Learning Decision Trees using the Fourier Spectrum - Kushilevitz, Mansour - 1993 |
| 82 | A deterministic algorithm for sparse multivariate polynomial interpolation - Ben-Or, Tiwari - 1988 |
| 50 | Fast Parallel Algorithms for Sparse Multivariate Polynomials Over Finite Fields - Grigoriev, Karpinski - 1990 |
| 37 | The matching problem for bipartite graphs with polynomially bounded permanents is in NC - Grigoriev, Karpinski |
| 9 | Interpolation of sparse rational functions without knowing bounds on the exponent - Grigoriev, Karpinski, et al. - 1990 |
| 7 | Boolean Circuit Complexity of Algebraic Interpolation Problems - Karpinski - 1989 |
