#4636: improve polynomial_modn_dense_ntl.Polynomial_dense_mod_p
---------------------------+------------------------------------------------
Reporter: ncalexan | Owner: was
Type: defect | Status: new
Priority: major | Milestone: sage-3.2.1
Component: number theory | Keywords: polynomial modn finite field gf
---------------------------+------------------------------------------------
sage.rings.polynomial.polynomial_modn_dense_ntl.Polynomial_dense_mod_p is
very old.
The attached patch removes (but doesn't yet delete -- could you verify it
can be removed, reviewer?) Polynomial_dense_mod_p and implements
polynomial_modn_dense_ntl.Polynomial_dense_modp_ntl_zz/ZZ using the newer
techniques.
It makes basic arithmetic faster. I was finding that arithmetic in
GF(next_prime(2^50))['x'] was slower than in
Zmod(next_prime(2^50)+1)['x'], but now I cannot find the comparison! In
any case, this is much faster for doing gcd/xgcd in GF(p)['x'].
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/4636>
Sage <http://sagemath.org/>
Sage - Open Source Mathematical Software: Building the Car Instead of
Reinventing the Wheel
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
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-trac?hl=en
-~----------~----~----~----~------~----~------~--~---
