On Wednesday 19 September 2007 16:22, William Stein wrote: > I think those timings are way out of date, since Singular 3 seems > to be *very* fast at mod p multivariate GCD computation, even > though it sucks over QQ. Check out this paper: > > http://www.cecm.sfu.ca/CAG/papers/brown.ps > > It on exactly the problem of GCD over QQ (or equiv ZZ), > and section 2 has a complete description of a gcd algorithm > that reduces gcd over ZZ to doing gcd's mod p.
I'll be looking into implementing that. It makes me disgruntled to be at the mercy of mathematica (or pick your favorite big commercial m). :D. -- 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/ -~----------~----~----~----~------~----~------~--~---
