tiny mug

The library computes the greatest common divisor of two univariate integer polynomials, whose coefficients are represented by multiple-precision integers provided by the GMP library. I wrote the code originally for CGAL, in 2007, but it was later removed for maintenance reasons.