Generic implementation of a modular GCD over Algebraic Extension Fields
Michael Hemmer, Dominik Hülse · 2009
We report on several generic implementations for uni-variate polynomial gcd computation over the integers and, in particular, over algebraic extensions. Our benchmarks show that the generic implementation compares favorably to well established libraries. Even for the integer case our implementation is competitive to the one provided by the NTL, which does not sup-port algebraic extensions. Our software is part of the new Polynomial package of Cgal release 3.4. 1