Yes, that works for me. I just don't know how to use MAGMA. Here is the script I used:
a:=[1 .. 255 by 1]; b:=[1 .. 255 by 1]; for i:=1 to 1000 do for j:= 1 to 255 do a[j]:=RandomBits(1000); b[j]:=RandomBits(1000); end for; temp:=Polynomial(a)*Polynomial(b); end for; I still don't see why that is so much slower, but then again I don't even understand the stupid notation MAGMA requires just to define a polynomial. Oh well, so it is back to the drawing board as far as finding a fast algorithm is concerned then. I have some ideas, but they are taking some time to implement. --~--~---------~--~----~------------~-------~--~----~ 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/ -~----------~----~----~----~------~----~------~--~---
