(sage 2.10 on X86 linux.) Suppose you define the ring of polynomials over GF(2):
R.<x> = GF(2)[] Then a simple polynomial like f = x^32000 takes time quadratic in the degree to construct. Meanwhile, the left shift operator will construct the polynomial almost instantly: f = x << (32000 - 1) Also, constructing from a list of coefficients takes quadratic time if most of the coefficients are zero. For example f = R( [1]+ 32000*[0] + [1]) is very slow, but a dense list is fast: f = R(32000*[1]) --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-support@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-support URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
