On 13 Jan, 12:17, Martin Albrecht <m...@informatik.uni-bremen.de>
wrote:
> The following is multiplication of two random polynomials over
> GF(140737488355328) of length n
>
> n FLINT zn_poly
> 131072 0.292 0.220
> 262144 0.612 0.454
> 524288 1.522 1.028
> 1048576 3.136 2.096
These are unexpected figures.
Just out of interest, did you compile zn_poly with or without the
USE_FLINT option.
I'm scratching my head a little, as last I heard, zn_poly was about
the same speed as FLINT for length 1,000,000. I suspect there has
either been a speed regression in FLINT which needs fixing, or David
has once again done something special!!
BTW you will definitely find that for smaller moduli zn_poly is
considerably faster for the short to medium lengths.
Bill.
--~--~---------~--~----~------------~-------~--~----~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to
sage-devel-unsubscr...@googlegroups.com
For more options, visit this group at http://groups.google.com/group/sage-devel
URLs: http://www.sagemath.org
-~----------~----~----~----~------~----~------~--~---
