The EEZ-GCD algorithm

DOI10.1145/1089220.1089228MaRDI QIDQ3890106zbMATH OpenOpenAlexFDO

Authors Paul S. Wang

Publication date 1980

Published in ACM SIGSAM Bulletin (Search for Journal in Brave)

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

zbMATH Keywords

greatest common divisor of multi-variate polynomialsHensel's lemmap-adic constructionspolynomial GCD

Mathematics Subject Classification ID

Polynomials in number theory (11C08) Polynomials (irreducibility, etc.) (11R09) Polynomials (11S05) Polynomials in real and complex fields: factorization (12D05) Symbolic computation and algebraic computation (68W30)

Cited in

(12)

• GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation
• Three new algorithms for multivariate polynomial GCD
• A proof of the two parameter \(q\)-cases of the Macdonald-Morris constant term root system conjecture for \(S(F_ 4)\) and \(S(F_ 4)^ \vee\) via Zeilberger's method
• Computing sparse GCD of multivariate polynomials via polynomial interpolation
• A fast parallel sparse polynomial GCD algorithm
• An improved EZ-GCD algorithm for multivariate polynomials
• Parallelization of triangular decompositions: techniques and implementation
• \textsc{Rings}: an efficient Java/Scala library for polynomial rings
• A new black box GCD algorithm using Hensel lifting
• Improvements of the power-series coefficient polynomial remainder sequence GCD algorithm
• Bit complexity of polynomial GCD on sparse representation
• A new sparse polynomial GCD by separating terms

This page was built for publication: The EEZ-GCD algorithm

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