2007/9/19, Joel B. Mohler [EMAIL PROTECTED]:
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:
On 9/19/07, Joel B. Mohler [EMAIL PROTECTED] wrote:
As I wrote on sage-devel a bit earlier, I had some polynomials that were
causing singular gcd to slow down dramatically. I had thought this was
inconsistent, but upon more investigation it seems very consistent (on two
different computers).
On Sep 19, 9:55 pm, William Stein [EMAIL PROTECTED] wrote:
On 9/19/07, Joel B. Mohler [EMAIL PROTECTED] wrote:
As I wrote on sage-devel a bit earlier, I had some polynomials that were
causing singular gcd to slow down dramatically. I had thought this was
inconsistent, but upon more
On 9/19/07, mabshoff
[EMAIL PROTECTED] Well, we had
some more discussion in #sage-devel and rpw posted an
interesting link:
http://magma.maths.usyd.edu.au/users/allan/gcdcomp.html
In summary: Singular's multivariate GCD is slower by orders of
magnitude. Magma's algorithms are described at:
On Wednesday 19 September 2007 15:55, William Stein wrote:
Just for clarity, why not just compute the GCD with mathematica?
Well, I am doing that. I assumed that I had found a slow corner case that
singular folks would want to fix. I'm not entirely sure that this point how
small that corner
On 9/19/07, Joel B. Mohler [EMAIL PROTECTED] wrote:
On Wednesday 19 September 2007 15:55, William Stein wrote:
Just for clarity, why not just compute the GCD with mathematica?
Well, I am doing that.
I didn't mean for your program -- just for benchmarking purposes.
I assumed that I had
On Sep 19, 4:22 pm, William Stein [EMAIL PROTECTED] wrote:
On 9/19/07, mabshoff
[EMAIL PROTECTED] Well, we had
some more discussion in #sage-devel and rpw posted an
interesting link:
http://magma.maths.usyd.edu.au/users/allan/gcdcomp.html
In summary: Singular's multivariate GCD is
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
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
