A ZZ_pE indeed appears to be implemented as a ZZ_pX with a fixed ZZ_pXModulus (used for preconditioning). So NTL does seem to manage the preconditioning for you.
You can also do preconditioned arithmetic in ZZ_pEX, and then you are required to manage the preconditioning again. But you probably already knew that. Bill. On 25 Sep, 04:17, "David Roe" <[EMAIL PROTECTED]> wrote: > Hey all, > I'm working on adding NTL's ZZ_pE (finite ring extensions of Z/p) and ZZ_pEX > (polynomials over ZZ_pE) classes to Sage. > > The ZZ_pX module has facilities for doing modular arithmetic modulo a > preconditioned modulus f. How is this different from arithmetic in ZZ_pE > (or is it different at all)? Does ZZ_pE take care of the preconditioning > for me? > David --~--~---------~--~----~------------~-------~--~----~ 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/ -~----------~----~----~----~------~----~------~--~---
