On 1 Apr, 05:21, "Mike Hansen" <[EMAIL PROTECTED]> wrote:
> I've posted some benchmarks
> athttp://wiki.sagemath.org/MultivariateGCDBenchmarks.
>
> --Mike
I can't do timings for the degree 1000 or 2000 (at least Allan Steel
gives it as degree 2000, whereas your page Mike seems to say it is
degree 10000), since FLINT doesn't have the asymptotically fast half
gcd implemented yet for polynomials over Z/pZ, which is a prerequisite
for fast times for these problems.
But for the degree 100 problem I can give a rough preliminary timing.
FLINT computes it in 0.0008949s. Magma currently takes 0.0008300s. So
I guess that is about 24 times faster than ezgcd and 30 times faster
than modular and 200 times faster than Maxima and 2000 times faster
than NTL (or is it Pari? - I don't know what the (univariate) timing
means).
FLINT will be at least 50% faster by the time I'm done with this
function. It's not even properly tuned yet!
Bill.
--~--~---------~--~----~------------~-------~--~----~
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://www.sagemath.org
-~----------~----~----~----~------~----~------~--~---
