Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields

Recommendations

scientific article; zbMATH DE number 871950
Interpolation of Sparse Multivariate Polynomials over Large Finite Fields with Applications
Faster interpolation algorithms for sparse multivariate polynomials given by straight-line programs
Sparse polynomial interpolation based on diversification
Sparse interpolation over finite fields via low-order roots of unity

Cited in

(44)

Interpolation of polynomials given by straight-line programs
On zero-testing and interpolation of \(k\)-sparse multivariate polynomials over finite fields
The complexity of sparse polynomial interpolation over finite fields
On some approximation problems concerning sparse polynomials over finite fields
Zero testing of \(p\)-adic and modular polynomials
An improved early termination sparse interpolation algorithm for multivariate polynomials
The interpolation problem for \(k\)-sparse polynomials and character sums
The interpolation problem for \(k\)-sparse sums of eigenfunctions of operators
Early termination in sparse interpolation algorithms
Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases
Sparse shifts for univariate polynomials
Sparse polynomial interpolation: sparse recovery, super-resolution, or Prony?
Sparse polynomial interpolation based on diversification
Revisit sparse polynomial interpolation based on randomized Kronecker substitution
Fast Hermite interpolation and evaluation over finite fields of characteristic two
Modular algorithm for sparse multivariate polynomial interpolation and its parallel implementation
Faster sparse multivariate polynomial interpolation of straight-line programs
Exact learning from an honest teacher that answers membership queries
On learning multivariate polynomials under the uniform distribution
Interpolation and Approximation of Sparse Multivariate Polynomials over GF(2)
Sparse interpolation over finite fields via low-order roots of unity
A new deterministic algorithm for sparse multivariate polynomial interpolation
A local decision test for sparse polynomials
Reconstructing Algebraic Functions from Mixed Data
scientific article; zbMATH DE number 1273635 (Why is no real title available?)
scientific article; zbMATH DE number 871950 (Why is no real title available?)
Interpolation of Sparse Multivariate Polynomials over Large Finite Fields with Applications
Luby-Veličković-Wigderson revisited: improved correlation bounds and pseudorandom generators for depth-two circuits
Sparse polynomial interpolation over fields with large or zero characteristic
Fast multipoint evaluation and interpolation of polynomials in the LCH-basis over F _P ^r
Randomized interpolation and approximation of sparse polynomials stPreliminary version
scientific article; zbMATH DE number 4182832 (Why is no real title available?)
Symbolic-numeric sparse interpolation of multivariate polynomials
Zero testing and equation solving for sparse polynomials on rectangular domains
Sparse interpolation of multivariate rational functions
Efficiently testing sparse \(\text{GF}(2)\) polynomials
Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in
Fast interpolation of multivariate polynomials with sparse exponents
Counting curves and their projections
NP-hardness of testing equivalence to sparse polynomials and to constant-support polynomials
Algebraic notes on testing sets for lower and upper grids
Fast interpolation and multiplication of unbalanced polynomials
An explicit separation of relativised random polynomial time and relativised deterministic polynomial time
Deterministically testing sparse polynomial identities of unbounded degree

This page was built for publication: Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3495652)