On Sep 13, 2007, at 9:07 PM, William Stein wrote: > On 9/13/07, John Voight <[EMAIL PROTECTED]> wrote:
[...] >> So there's no hope: there's just overhead in the coercion here? > > Nobody has ever spent any effort on optimizing the following in SAGE: > - number field construction > - If f is a polynomial over ZZ, constructing the corresponding > polynomial over QQ (which is taking a substantial chunk of the > time) Currently, ZZ[x] -> QQ[x] does ntl_ZZ -> str -> list -> list of rationals -> str -> pari Perhaps QQ[x] should be implemented as ZZ[x] + denominator? - Robert --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-devel@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-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~----------~----~----~----~------~----~------~--~---
