I've redone both graphs since the generic NTL profiling code in FLINT was assuming that a length n polynomial had n+1 coefficients (my student had done this due to some confusion about the way coefficients were counted).
The graph for polynomials with two large factors (at least): http://sage.math.washington.edu/home/wbhart/flint-trunk/graphing/factor.png and the graph for generic polynomials: http://sage.math.washington.edu/home/wbhart/flint-trunk/graphing/factor-gen.png Hopefully these are correct now. Bill. On 20 Dec, 17:49, Bill Hart <[EMAIL PROTECTED]> wrote: > Here is the graph for generic polynomials: > > http://sage.math.washington.edu/home/wbhart/flint-trunk/graphing/fact... > > At about 1000 bits and length 6, NTL does seem to get ahead again. > > 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://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~----------~----~----~----~------~----~------~--~---
