Symbolic Computation Group
David R. Cheriton School of Computer Science


Friday, April 2, 2004, at U. of Western Ontario.
Abstract:
Let K be a field of rational functions and L be a direct product of fields
extending K by a tower of simple algebraic extensions. We present a modular
algorithm for computing polynomial gcds over L based on a Hensel lifting
strategy.

Last modified on Sunday, 04 November 2012, at 15:42 hours.