Michael Monagan

A parallel implementation for polynomial multiplication modulo a prime

2015

We present a parallel implementation in Cilk C of a modular algorithm for multiplying two polynomials in Zq[x] for integer q > 1, for multi-core computers. Our algorithm uses Chinese remaindering. It multiplies modulo primes …

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 …