On Thursday 01 February 2007 14:28, Martin Albrecht wrote: > There is a specialized implementation for polynomials over Z mod N which is > faster than the generic implementation which is used for GF(2^3). This is > certainly fixable (by writing a specialized implementation for GF(p^n). > > Does this help?
That seems quite reasonable. I'm able to do what I want to do for the moment. If I want more, I will pursue this route. Thanks. -- Joel --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to [email protected] 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/ -~----------~----~----~----~------~----~------~--~---
