Randomized interpolation and approximation of sparse polynomials stPreliminary version
From MaRDI portal
Publication:5204322
Recommendations
- Randomized Interpolation and Approximation of Sparse Polynomials
- Revisit sparse polynomial interpolation based on randomized Kronecker substitution
- A new algorithm for sparse interpolation of multivariate polynomials
- A new deterministic algorithm for sparse multivariate polynomial interpolation
- Sparse Polynomial Interpolation in Nonstandard Bases
- Robust algorithms for sparse interpolation of multivariate polynomials
- Robust computation methods for sparse interpolation of multivariate polynomials
- scientific article; zbMATH DE number 1273635
- Sparse polynomial interpolation based on diversification
- Faster interpolation algorithms for sparse multivariate polynomials given by straight-line programs
Cites work
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 4182832 (Why is no real title available?)
- A guided tour of Chernoff bounds
- Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields
- Learning Decision Trees Using the Fourier Spectrum
Cited in
(10)- Randomized Interpolation and Approximation of Sparse Polynomials
- scientific article; zbMATH DE number 7053345 (Why is no real title available?)
- \(\varepsilon\)-discrepancy sets and their application for interpolation of sparse polynomials
- A deterministic sparse FFT for functions with structured Fourier sparsity
- Sparsified randomization algorithms for low rank approximations and applications to integral equations and inhomogeneous random field simulation
- scientific article; zbMATH DE number 7561529 (Why is no real title available?)
- Private multiparty sampling and approximation of vector combinations
- Sparse harmonic transforms. II: Best \(s\)-term approximation guarantees for bounded orthonormal product bases in sublinear-time
- An explicit separation of relativised random polynomial time and relativised deterministic polynomial time
- Finding significant Fourier coefficients: clarifications, simplifications, applications and limitations
This page was built for publication: Randomized interpolation and approximation of sparse polynomials stPreliminary version
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5204322)