On Wednesday 12 December 2007 18:24, William Stein wrote: > Anyway, Yi just made this planet sage blog thing: > http://sage.math.washington.edu/home/yqiang/psage/output/ > So I looked at it, and saw Martin Albrecht's blog posts, which I > hadn't looked at before. Those led me to the Giac site, where > I read a talk about Giac and realized it does multivariate factorization, > and has the *ugliest* screenshots known to man... > Anyway, at the Giac site I found this paper by the author of Giac: > "A correct proof of the heuristic GCD algorithm"
Nice! Sort of coincidentally, Paul Gunnells sent me a link for the exact analog of this for factoring (as William had already pointed out further on in his e-mail): http://vivatsgasse7.wordpress.com/2007/11/10/tricks-using-pari/ It almost seems too easy to be true... In reality, *both* gcd and factoring are a problem for me so I'll be implementing this for mpolynomials over ZZ. -- 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/ -~----------~----~----~----~------~----~------~--~---
