GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation
DOI10.1016/S0747-7171(89)80004-5zbMATH Open0679.12013OpenAlexW2077853647MaRDI QIDQ1124635FDOQ1124635
Authors: Bruce W. Char, Keith O. Geddes, Gaston H. Gonnet 
Publication date: 1989
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0747-7171(89)80004-5
Recommendations
Symbolic computation and algebraic computation (68W30) Polynomials (irreducibility, etc.) (11R09) Polynomials in real and complex fields: factorization (12D05) Software, source code, etc. for problems pertaining to field theory (12-04)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Subresultant PRS Algorithm
- Subresultants and Reduced Polynomial Remainder Sequences
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
- The EEZ-GCD algorithm
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (7)
- In honour of Keith Geddes on his 60th birthday
- Gcd of multivariate polynomials via Newton polytopes
- On degrees of modular common divisors and the big prime gcd algorithm
- A fast parallel sparse polynomial GCD algorithm
- Estimating the greatest common divisor of the value of two polynomials
- GCDHEU
- Three new algorithms for multivariate polynomial GCD
Uses Software
This page was built for publication: GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1124635)
