GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation
From MaRDI portal
Publication:1124635
DOI10.1016/S0747-7171(89)80004-5zbMath0679.12013MaRDI QIDQ1124635
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
68W30: Symbolic computation and algebraic computation
12D05: Polynomials in real and complex fields: factorization
11R09: Polynomials (irreducibility, etc.)
12-04: Software, source code, etc. for problems pertaining to field theory
Related Items
GCDHEU, In honour of Keith Geddes on his 60th birthday, A fast parallel sparse polynomial GCD algorithm
Uses Software
Cites Work