Hi, I've been researching this slow mpolynomial factorization a bit more and haven't come up with any good news. Hans (from singular) replied to my forum post at http://singular.mathematik.uni-kl.de/forum/viewtopic.php?t=1652 It seems as though singular's random choices of evaluation points needs some tuning. I can't make a judgement whether it is a good algorithm on the whole.
I had a little sage script running on my computer (a respectable but aging pentium 4) for the past 4 days. I rewrote it to use magma for the factorization (nothing else changed in the script) and ran it on sage.math. I can compute much more on sage.math with help from magma in 2 minutes than I did in 4 days at home. All that to say: bah humbug! Anyhow, is singular our only option for multivariate factorization? Is there a guru out there that can vouch for or against their algorithm as a whole. I've found this article (by Shuhong Gao): http://kiwistrawberry.us/research/multivariate-factoring.pdf which seems fairly recent and factors bivariate polynomials. The algorithm also uses random evaluation points to get down to a bivariate polynomial (I guess, for all I know, it's the same algorithm as singular uses). -- 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/ -~----------~----~----~----~------~----~------~--~---
