Randomized Interpolation and Approximationof Sparse Polynomials

Authors:
Yishay Mansour
Affiliations:
-
Venue:
SIAM Journal on Computing
Year:
1995

Citing 0
Cited 18

On learning arithmetic read-once formulas with exponentiation (extended abstract)

COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Algorithms for computing sparse shifts for multivariate polynomials

ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
On the Fourier spectrum of monotone functions

Journal of the ACM (JACM)
Theoretical and experimental analysis of a randomized algorithm for Sparse Fourier transform analysis

Journal of Computational Physics
Symbolic-numeric sparse interpolation of multivariate polynomials

Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Interpolation of depth-3 arithmetic circuits with two multiplication gates

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Explicit constructions for compressed sensing of sparse signals

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Decodability of group homomorphisms beyond the johnson bound

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Cryptographic hardness for learning intersections of halfspaces

Journal of Computer and System Sciences
Property Testing: A Learning Theory Perspective

Foundations and Trends® in Machine Learning
Symbolic-numeric sparse interpolation of multivariate polynomials

Journal of Symbolic Computation
Interpolation of polynomials given by straight-line programs

Theoretical Computer Science
A local decision test for sparse polynomials

Information Processing Letters
Diversification improves interpolation

Proceedings of the 36th international symposium on Symbolic and algebraic computation
Combinatorial algorithms for compressed sensing

SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Reducing a target interval to a few exact queries

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Homomorphic hashing for sparse coefficient extraction

IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Improved sparse fourier approximation results: faster implementations and stronger guarantees

Numerical Algorithms

Quantified Score

Hi-index	0.01

Visualization

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