On Sep 19, 10:52 pm, Jack Schmidt <[EMAIL PROTECTED]>
wrote:
> On Sep 19, 4:22 pm, "William Stein" <[EMAIL PROTECTED]> wrote:
<SNIP>
> > Who wants to be a hero -- like Jon Bober and number of partitions --
> > and implement this for Sage, so that multivariate GCD's aren't
> > embarrassingly slow in Sage anymore? This slowness *has*
> > been something reported to me on several occasions during
> > the last 2 years:
> > http://trac.sagemath.org/sage_trac/ticket/696
>
that is http://trac.sagemath.org/sage_trac/ticket/694 now
> > William
Hello
>
> It might be better to contribute such a implementation directly to
> singular.
>
In the end that might happen, but development in Singular is more
complicated because only malb really knows the Singular code and
memory management is more complicated, compiling cython code is much
quicker and for prototyping that counts (at least in my opinion).
> The current singular implementation is described at:
>
> http://www.singular.uni-kl.de/Manual/latest/sing_32.htm
>
> as using the algorithm described in:
>
> http://doi.acm.org/10.1145/800192.805698
Cool.
Cheers,
Michael
--~--~---------~--~----~------------~-------~--~----~
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/
-~----------~----~----~----~------~----~------~--~---
