On Sun, Jan 20, 2013 at 12:29 PM, Santanu Sarkar <[email protected]> wrote: > Dear all, > We know using Fast Fourier Transform we can evaluate a polynomial f(x) > of degree n at n points x_1, .., x_n in O(n) time. Is it implemented in > Sage?
It is in the gsl module http://hg.sagemath.org/sage-main/file/9519a7bb2f42/sage/gsl > > -- > You received this message because you are subscribed to the Google Groups > "sage-support" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > Visit this group at http://groups.google.com/group/sage-support?hl=en. > > -- You received this message because you are subscribed to the Google Groups "sage-support" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. Visit this group at http://groups.google.com/group/sage-support?hl=en.
