mod_gcd: naive hack to chose a 'good' prime (to speed up gcd computation).
[ginac.git] / ginac / polynomial / remainder.tcc
2008-09-30 Alexei Sheplyakov[bugfix] remainder_in_ring: using exact division is...
2008-09-30 Jens VollingaMerge branch 'master' of git://ffmssmsc.jinr.ru:443...
2008-09-20 Alexei SheplyakovImplemented modular GCD algorithm for univariate polyno...