A fast parallel sparse polynomial GCD algorithm

DOI10.1145/2930889.2930903MaRDI QIDQ2985837zbMATH OpenOpenAlexFDO

Authors Jiaxiong Hu, Michael Monagan

Publication date 10 May 2017

Published in Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2930889.2930903

zbMATH Keywords

sparse polynomial interpolationZippel's algorithmBen-Or/Tiwari interpolationpolynomial GCD computation

Mathematics Subject Classification ID

Numerical interpolation (65D05) Factorization (11Y05)

Recommendations

• A fast parallel sparse polynomial GCD algorithm
• scientific article; zbMATH DE number 17841
• scientific article; zbMATH DE number 1263395
• A sparse modular GCD algorithm for polynomials over algebraic function fields
• scientific article; zbMATH DE number 871950

Cited in

(16)

• Factoring sparse polynomials fast
• Parallel algorithms on greatest common divisor of polynomial system
• Irreducibility and greatest common divisor algorithms for sparse polynomials
• An interpolation algorithm for computing Dixon resultants
• Computing sparse GCD of multivariate polynomials via polynomial interpolation
• An improved EZ-GCD algorithm for multivariate polynomials
• A fast parallel sparse polynomial GCD algorithm
• A new black box GCD algorithm using Hensel lifting
• 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
• Sparse polynomial interpolation: faster strategies over finite fields
• A new absolute irreducibility criterion for multivariate polynomials over finite fields
• Fast interpolation of multivariate polynomials with sparse exponents
• Bit complexity of polynomial GCD on sparse representation
• Parallelization of triangular decompositions: techniques and implementation

Describes a project that uses

Uses Software

• Cilk
• Maple
• Magma

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)