Randomized Interpolation and Approximation of Sparse Polynomials
From MaRDI portal
(Redirected from Publication:4834385)
Recommendations
- Randomized interpolation and approximation of sparse polynomials stPreliminary version
- Interpolation and Approximation of Sparse Multivariate Polynomials over GF(2)
- Interpolation of Sparse Multivariate Polynomials over Large Finite Fields with Applications
- Faster sparse interpolation of straight-line programs
- A new deterministic algorithm for sparse multivariate polynomial interpolation
Cited in
(28)- Interpolation of polynomials given by straight-line programs
- Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit
- On interpolating arithmetic read-once formulas with exponentiation
- Sparse shifts for univariate polynomials
- Sparse polynomial interpolation based on derivatives
- Faster interpolation algorithms for sparse multivariate polynomials given by straight-line programs
- Improved sparse Fourier approximation results: Faster implementations and stronger guarantees
- Cryptographic hardness for learning intersections of halfspaces
- Theoretical and experimental analysis of a randomized algorithm for sparse Fourier transform analysis
- A multiscale sub-linear time Fourier algorithm for noisy data
- Polynomial homotopy method for the sparse interpolation problem. I: Equally spaced sampling
- Black-box polynomial resultants
- On learning multivariate polynomials under the uniform distribution
- scientific article; zbMATH DE number 421669 (Why is no real title available?)
- Book Review: A mathematical introduction to compressive sensing
- Interpolation and Approximation of Sparse Multivariate Polynomials over GF(2)
- A local decision test for sparse polynomials
- Sparsified randomization algorithms for low rank approximations and applications to integral equations and inhomogeneous random field simulation
- Randomized interpolation and approximation of sparse polynomials stPreliminary version
- Rapidly computing sparse Legendre expansions via sparse Fourier transforms
- Random Construction of Interpolating Sets for High-Dimensional Integration
- Robust algorithms for sparse interpolation of multivariate polynomials
- Symbolic-numeric sparse interpolation of multivariate polynomials
- Efficiently testing sparse \(\text{GF}(2)\) polynomials
- -discrepancy sets and their application for interpolation of sparse polynomials
- Fast interpolation and multiplication of unbalanced polynomials
- A multivariate generalization of Prony's method
- Combinatorial sublinear-time Fourier algorithms
This page was built for publication: Randomized Interpolation and Approximation of Sparse Polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4834385)
