On Monday, April 27, 2015 at 10:47:29 PM UTC-7, vdelecroix wrote: > > Note that the data structure used for the above polynomial r will be > *very* slow compared to using directly the multivariate polynomial ring > QQ['x','y','z','u','v','a','s','t']. So I would rather advice you to try > hard using this one instead of the recursive version. > That depends on what you want to do. For some polynomial computations, recursive dense representation is quite compact and efficient.
-- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at http://groups.google.com/group/sage-support. For more options, visit https://groups.google.com/d/optout.
