Implemented modular GCD algorithm for univariate polynomials.
authorAlexei Sheplyakov <varg@theor.jinr.ru>
Sat, 20 Sep 2008 19:18:46 +0000 (23:18 +0400)
committerAlexei Sheplyakov <varg@theor.jinr.ru>
Sat, 20 Sep 2008 19:18:46 +0000 (23:18 +0400)
commit546bababce8ef2b3c5ed3011cb7e49bd78016844
tree27c11e1104416108cee6aae981c84a0c6a93d236
parent8c732512ca284f2a586694c7c33f1a0a4a68cef7
Implemented modular GCD algorithm for univariate polynomials.
16 files changed:
check/Makefile.am
check/exam_cra.cpp [new file with mode: 0644]
check/exam_mod_gcd.cpp [new file with mode: 0644]
ginac/Makefile.am
ginac/polynomial/cra_garner.cpp [new file with mode: 0644]
ginac/polynomial/cra_garner.hpp [new file with mode: 0644]
ginac/polynomial/debug.hpp [new file with mode: 0644]
ginac/polynomial/gcd_euclid.tcc [new file with mode: 0644]
ginac/polynomial/mod_gcd.cpp [new file with mode: 0644]
ginac/polynomial/mod_gcd.hpp [new file with mode: 0644]
ginac/polynomial/normalize.tcc [new file with mode: 0644]
ginac/polynomial/remainder.tcc [new file with mode: 0644]
ginac/polynomial/ring_traits.hpp [new file with mode: 0644]
ginac/polynomial/upoly.hpp [new file with mode: 0644]
ginac/polynomial/upoly_io.cpp [new file with mode: 0644]
ginac/polynomial/upoly_io.hpp [new file with mode: 0644]