The EEZ-GCD algorithm

DOI10.1145/1089220.1089228zbMath0445.68026OpenAlexW2019165106MaRDI QIDQ3890106

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

Hensel's lemmapolynomial GCDp-adic constructionsgreatest common divisor of multi-variate polynomials

Mathematics Subject Classification ID

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

Related Items

Computing sparse GCD of multivariate polynomials via polynomial interpolation, GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation, Parallelization of triangular decompositions: techniques and implementation, \textsc{Rings}: an efficient Java/Scala library for polynomial rings, Three new algorithms for multivariate polynomial GCD, A fast parallel sparse polynomial GCD algorithm, 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, Improvements of the power-series coefficient polynomial remainder sequence GCD algorithm, An improved EZ-GCD algorithm for multivariate polynomials