]> www.ginac.de Git - ginac.git/history - check/bugme_chinrem_gcd.cpp
git://www.ginac.de / ginac.git / history
? search:
summary | shortlog | log | commit | commitdiff | tree
first ⋅ prev ⋅ next
pgcd(): detect relatively prime polynomials properly...
[ginac.git] / check / bugme_chinrem_gcd.cpp
2009-02-06 Jens VollingaPrettified source code. blob | commitdiff | raw
2009-02-06 Alexei SheplyakovFix chinese_remainder() so modular GCD actually works. blob | commitdiff | raw | diff to current
GiNaC -- a C++ library for symbolic computations