On Tuesday 04 December 2007 02:31, William Stein wrote: > > I think we discussed this on the list before. For univariate you want > > van hoeij's algorithm and for multivariate some variant of GCDHEU or > > EZGCD. > > > > I think the algorithm Singular are using, EZGCD, is probably pretty > > good. They just need to work on improving it perhaps. Magma uses van > > Hoeij's algorithm for univariate factorization and the multivariate > > case is basically reduced to this. They use GCDHEU I believe for the > > multivariate case. Maple probably uses both GCDHEU and EZGCD and tries > > to choose the best one. > > I'm a little confused -- before we were discussing multivariate *GCD* in > the context of "magma is way faster than Singular for this example that > Joel came up with". Now we're talking about multivariate polynomial > factorization. What's the connection between the two problems, which > you're sort of identifying above?
I don't know what the connection is, but Hans himself saw some connection between the two in his response at http://www.singular.uni-kl.de/forum/viewtopic.php?t=1652 I actually e-mailed Hans back yesterday to inquire about using the multi-modular gcd inside factorize. It seems worth a try to get better performance in my case (although I'm beginning to believe that my case is special somehow). -- Joel --~--~---------~--~----~------------~-------~--~----~ 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/ -~----------~----~----~----~------~----~------~--~---
