>>> This should create the polynomial x, then try to raise it to the power
>>> of 2^30, which is about a billion I think.
>>> Along the way it will use the FFT, which is a bit of a memory hog.
>>> One day we ought to fix the powering code to handle monomials
>>> separately. It is 2016 after all.
>> I imagine that, more generally, for the fewnomials (so that the monimials
>> are (almost) algebraically independent), it's faster to do "naive"
>> powering, no? (i.e., the multinomial formula)
> There are many algorithms for powering of multivariate polynomials. But
> yes, in the case of univariates, the multinomial formula is fast. Actually,
> now that you mention it, we have that implemented. I'm not sure why that
> wouldn't be used here by default. It's clearly not, since that wouldn't run
> out of memory.
Oh, I guess the multinomial code may not be in the latest official Flint
You received this message because you are subscribed to the Google Groups
To unsubscribe from this group and stop receiving emails from it, send an email
To post to this group, send email to firstname.lastname@example.org.
Visit this group at https://groups.google.com/group/sage-devel.
For more options, visit https://groups.google.com/d/optout.