A fast parallel sparse polynomial GCD algorithm
From MaRDI portal
Recommendations
Cited in
(19)- Computing sparse GCD of multivariate polynomials via polynomial interpolation
- A fast parallel sparse polynomial GCD algorithm
- An interpolation algorithm for computing Dixon resultants
- An improved EZ-GCD algorithm for multivariate polynomials
- Parallel polynomial operations on SMPs: An overview
- Parallelization of triangular decompositions: techniques and implementation
- Parallel algorithms on greatest common divisor of polynomial system
- Irreducibility and greatest common divisor algorithms for sparse polynomials
- scientific article; zbMATH DE number 1263395 (Why is no real title available?)
- scientific article; zbMATH DE number 1273687 (Why is no real title available?)
- scientific article; zbMATH DE number 871951 (Why is no real title available?)
- Algorithms for the non-monic case of the sparse modular GCD algorithm
- Solving Parametric Linear Systems Using Sparse Rational Function Interpolation
- Fast interpolation of multivariate polynomials with sparse exponents
- A new black box GCD algorithm using Hensel lifting
- Sparse polynomial interpolation: faster strategies over finite fields
- A new absolute irreducibility criterion for multivariate polynomials over finite fields
- Bit complexity of polynomial GCD on sparse representation
- Factoring sparse polynomials fast
This page was built for publication: A fast parallel sparse polynomial GCD algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2985837)
