#8212: arithmetic on GF(2^n) might be improved
--------------------------------+-------------------------------------------
Reporter: zimmerma | Owner: zimmerma
Type: enhancement | Status: needs_review
Priority: minor | Milestone: sage-4.3.3
Component: basic arithmetic | Keywords:
Author: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
--------------------------------+-------------------------------------------
Comment(by zimmerma):
sage -t * did pass (more precisely it did not exhibit more failures with
respect to #7773), which
shows that the case p^n^ for n <= 15 should be exercised in the tests,
especially with the new
modulus=... options.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/8212#comment:5>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
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.
