On Mon, Mar 31, 2008 at 3:24 PM, David Harvey <[EMAIL PROTECTED]> wrote: > > > On Mar 31, 2008, at 6:09 PM, William Stein wrote: > > > Relevant code: > > [snip] > > To profile this properly, you shouldn't do it just at powers of ten, > since the running time will depend heavily on the factorisation > pattern of n. I guess you should do some examples with lots of small > prime factors, examples with high prime powers, examples with just a > prime, etc.
I know. I just had about 10 minutes to spend on this, and thought people might be interested in a data point. It might even inspire somebody (you!) to do something better :-). > Perhaps if you have a bound for the size of the coefficients you > could do a modular approach. Work mod N where the coefficients are > guaranteed to be at most N Would your new mod N poly arithmetic code be useful for this? -- William --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
