pgcd(): avoid infinite loop if the first GCD candidate coincides with GCD
[ginac.git] / ginac / polynomial / pgcd.cpp
2010-05-17 Alexei Sheplyakovpgcd(): avoid infinite loop if the first GCD candidate...
2010-03-05 Jens VollingaCopyright goes 2010.
2010-02-24 Alexei Sheplyakovpgcd(): detect relatively prime polynomials properly...
2009-02-06 Jens VollingaPrettified source code.
2009-02-03 Alexei SheplyakovImplement modular multivariate GCD (based on chinese...