because you use dense representation. Try P.<x>=PolynomialRing(QQ,sparse=True)
By the way, do you need QQ? RR or ZZ would probably be faster. On Nov 26, 3:06 pm, Nathann Cohen <nathann.co...@gmail.com> wrote: > I could cache the results... But I still do not understand why just > evaluating x^999999 takes so much time ! You really need 1 million variables?! -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel-unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
