]> www.ginac.de Git - ginac.git/history - ginac/polynomial
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 /
2008-10-14 Alexei Sheplyakovmod_gcd: naive hack to chose a 'good' prime (to speed... tree | commitdiff
2008-09-30 Alexei Sheplyakov[bugfix] remainder_in_ring: using exact division is... tree | commitdiff
2008-09-30 Alexei Sheplyakov[bugfix] normalize_in_ring: don't set the leading coeff... tree | commitdiff
2008-09-30 Jens VollingaMerge branch 'master' of git://ffmssmsc.jinr.ru:443... tree | commitdiff
2008-09-20 Alexei SheplyakovImplemented modular GCD algorithm for univariate polyno... tree | commitdiff
GiNaC -- a C++ library for symbolic computations