Abstract
Given two multivariate polynomials A and B with integer coefficientswe present a new GCD algorithm which computes G = gcd(A,B).Our algorithm is based on the Hu/Monagan GCD algorithm.If A = G A̅ and B = G B̅ we have modified the Hu/Monaganso that it can interpolate the smaller of G and A̅.
 We have implemented the new GCD algorithm in Maple withseveral subroutines coded in C for efficiency.Maple currently uses Zippel's sparse modular GCD algorithm.We present timing results comparing Maple's implementation of Zippel's algorithm
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
