Factorization Domain package for solvable polynomial rings

# Factorization domain package for solvable polynomial rings.

This package contains classes for solvable polynomials rings as (non-unique) factorization domains. Methods provided with interface `GreatestCommonDivisor` are e.g. left / right greatest common divisors `leftGcd()`, `rightGcd()`, left / right primitive part `leftPrimitivePart()` or `leftCoPrime()`.

To choose the correct implementation it is best use the factory classes `SGCDFactory` with methods `getImplementation()` or `getProxy()`. These methods will take care of all possible (implemented) coefficient rings properties. The polynomial coefficients must implement the `GcdRingElem` interface and so must allow greatest common divisor computations. Greatest common divisor computation is completely generic and works for any implemented integral domain. If special, optimized implementations exist they will be used.

Last modified: Fri May 13 19:57:34 CEST 2016

$Id$