Evaluation of the Heuristic Polynomial GCD.pdfVIP

Evaluation of the Heuristic Polynomial GCD HsinChao Phil Liao Richard J Fateman Computer Science Division EECS Department University of California at Berkeley Abstract Some GCD algorithms are based on some variation of the Euclidean algorithm extended to op erate over a p olynomial The Heuristic Polynomial GCD pro cedure GCDHEU is ring The most ecient known variant is the Subresultant used by the Maple computer algebra system but no other Polynomial Remainder Sequence PRS algorithm Because Maple has an esp ecially ecient kernel that pro vides fast integer arithmetic but a relatively slower inter There are algorithms based on mo dular homomorphisms preter for nonkernel co de the GCDHEU routine is esp e and their inverse mappings Some algorithms require more cially eective in that it moves much of the computation than one homomorphism in the construction of the GCD into bignum arithmetic and hence executes primarily in One example is the mo dular algorithm based on Chinese the kernel remaindering GCDCHREM used in Maple The algo We sp eculated that in other computer algebra systems rithms requiring only one homomorphic mapping are usu an implementation GCDHEU would not b e advantageous ally based on the Hensel construction Extended Zassen In particular if al l the system co de is compiled to run at haus GCD EZGCD and Extended EZGCD EEZGCD full s