Multivariate GCDs over Algebraic Function Fields

Michael Monagan, CECM

Friday January 27th, 2006, in K9509 at 10:30am.

Abstract: We have implemented the multivariate modular gcd routine of
Monagan and van Hoeij (2004) for polynomials over algebraic function
fields.  In this presentation we outline the main steps of the algorithm
and present some timings for dense and sparse gcd problems comparing our
algorithm to Maple's built-in subresultant implementation.

Link to timing data (.txt)