]> www.ginac.de Git - ginac.git/history - ginac/polynomial/remainder.tcc
git://www.ginac.de / ginac.git / history
? search:
summary | shortlog | log | commit | commitdiff | tree
first ⋅ prev ⋅ next
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... blob | commitdiff | raw
2008-09-30 Jens VollingaMerge branch 'master' of git://ffmssmsc.jinr.ru:443... blob | commitdiff | raw | diff to current
2008-09-20 Alexei SheplyakovImplemented modular GCD algorithm for univariate polyno... blob | commitdiff | raw | diff to current
GiNaC -- a C++ library for symbolic computations