Rewritten heuristic and PRS GCD for univariate polynomials, added benchmark.
authorAlexei Sheplyakov <varg@theor.jinr.ru>
Sun, 19 Oct 2008 17:27:14 +0000 (21:27 +0400)
committerAlexei Sheplyakov <varg@theor.jinr.ru>
Sun, 19 Oct 2008 17:27:14 +0000 (21:27 +0400)
commitc7d9b624cb4bd5658a36fbcac2f73dbdb99edd5f
treec7a5e7532f51c662a8faa308dc17c87e9092c5cf
parent47b7f9c9b4a5bd91c7c83b12bac8481b55bf4b92
Rewritten heuristic and PRS GCD for univariate polynomials, added benchmark.

Using a better data structure for univariate polynomials makes GCD 10 -- 300
times faster (and less memory hungry).
check/Makefile.am
check/test_runner.h [new file with mode: 0644]
check/time_uvar_gcd.cpp [new file with mode: 0644]
ginac/Makefile.am
ginac/polynomial/eval_uvar.h [new file with mode: 0644]
ginac/polynomial/gcd_uvar.cpp [new file with mode: 0644]
ginac/polynomial/heur_gcd_uvar.h [new file with mode: 0644]
ginac/polynomial/interpolate_padic_uvar.h [new file with mode: 0644]
ginac/polynomial/prem_uvar.h [new file with mode: 0644]
ginac/polynomial/sr_gcd_uvar.h [new file with mode: 0644]