Having said all that, Magma uses the GCDHEU algorithm and a modular algorithm. Note that m in the above is the size in bits of the coefficients of the resultant, which you don't know an a priori bound for. You can figure out a bound however, but as in both algorithms, you need to know the roots of the polynomials you are taking the GCD of before you can get that.
Bill. --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~----------~----~----~----~------~----~------~--~---
