3 Dec
2006
3 Dec
'06
6:47 p.m.
Alexei Sheplyakov wrote:
Heuristic code in gcd [very] often makes bad choice of the main variable. In particular, if one of polynomials (say, p2) does not contain the variable x which _is contained_ in another one (say, p1), than gcd(p1, p2) will use such a variable as a main, so subsequent calculation becomes unnecessary complicated. Fixing this substantially improves worst case performance (less than minute versus infinity).
I've just applied your patch to the main branch. Thanks. -richy. -- Richard B. Kreckel <http://www.ginac.de/~kreckel/>