Artifact 3ede46b99c92eb984ee54d8f7309729859e7cc19aedd3a5e1b53156050f069f2:
- Executable file
r37/doc/manual/heugcd.tex
— part of check-in
[f2fda60abd]
at
2011-09-02 18:13:33
on branch master
— Some historical releases purely for archival purposes
git-svn-id: https://svn.code.sf.net/p/reduce-algebra/code/trunk/historical@1375 2bfe0521-f11c-4a00-b80e-6202646ff360 (user: arthurcnorman@users.sourceforge.net, size: 586) [annotate] [blame] [check-ins using] [more...]
- Executable file
r38/doc/manual/heugcd.tex
— part of check-in
[f2fda60abd]
at
2011-09-02 18:13:33
on branch master
— Some historical releases purely for archival purposes
git-svn-id: https://svn.code.sf.net/p/reduce-algebra/code/trunk/historical@1375 2bfe0521-f11c-4a00-b80e-6202646ff360 (user: arthurcnorman@users.sourceforge.net, size: 586) [annotate] [blame] [check-ins using]
- Executable file
r38/lisp/csl/r38.doc/heugcd.tex
— part of check-in
[f2fda60abd]
at
2011-09-02 18:13:33
on branch master
— Some historical releases purely for archival purposes
git-svn-id: https://svn.code.sf.net/p/reduce-algebra/code/trunk/historical@1375 2bfe0521-f11c-4a00-b80e-6202646ff360 (user: arthurcnorman@users.sourceforge.net, size: 586) [annotate] [blame] [check-ins using]
An implementation of the heuristic GCD algorithm, first introduced by B.W. Char, K.O. Geddes and G.H. Gonnet, as described in J.H. Davenport and J. Padget, ``HEUGCD: How Elementary Upperbounds Generate Cheaper Data'', Proc. of EUROCAL '85, Vol 2, 18-28, published as Lecture Notes on Comp. Science, No. 204, Springer-Verlag, Berlin, 1985, is also available on an experimental basis. To use this algorithm, the switch {\tt HEUGCD}\ttindex{HEUGCD} should be on in addition to {\tt GCD}. Note that if both {\tt EZGCD} and {\tt HEUGCD} are on, the former takes precedence.