Mark van Hoeij

A Modular Algorithm for Computing Polynomial GCDs over Number Fields presented with Multiple Extensions

2016 · arXiv (Cornell University)

We consider the problem of computing the monic gcd of two polynomials over a number field L = Q(alpha_1,...,alpha_n). Langemyr and McCallum have already shown how Brown's modular GCD algorithm for polynomials over Q can …