scientific article; zbMATH DE number 871950
From MaRDI portal
Publication:4875225
Recommendations
- Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields
- Interpolation of Sparse Multivariate Polynomials over Large Finite Fields with Applications
- Sparse polynomial interpolation based on diversification
- Sparse interpolation over finite fields via low-order roots of unity
Cited in
(14)- Computing sparse GCD of multivariate polynomials via polynomial interpolation
- A fast parallel sparse polynomial GCD algorithm
- Noisy interpolation of sparse polynomials in finite fields
- An improved EZ-GCD algorithm for multivariate polynomials
- Modular algorithm for sparse multivariate polynomial interpolation and its parallel implementation
- A fast parallel sparse polynomial GCD algorithm
- Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields
- Noisy Interpolation of Multivariate Sparse Polynomials in Finite Fields
- Interpolation of Sparse Multivariate Polynomials over Large Finite Fields with Applications
- On sparse interpolation of rational functions and gcds
- Fast interpolation of multivariate polynomials with sparse exponents
- -discrepancy sets and their application for interpolation of sparse polynomials
- Sparse polynomial interpolation: faster strategies over finite fields
- Practical cryptanalysis of pseudorandom correlation generators based on quasi-abelian syndrome decoding
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4875225)