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

(40)

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

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)