#11628: GF() arithmetic slower than IntegerModRing()
------------------------------------+----------------------------
Reporter: zimmerma | Owner: AlexGhitza
Type: defect | Status: needs_review
Priority: major | Milestone: sage-5.13
Component: basic arithmetic | Resolution:
Keywords: | Merged in:
Authors: Peter Bruin | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: | Stopgaps:
------------------------------------+----------------------------
Changes (by pbruin):
* status: new => needs_review
Comment:
With the patch, the `GF(q)` version is now slightly faster on my system.
The line that this patch removes in `finite_field_prime_modn.py` was
redundant because `FiniteField_prime_modn` inherits `factored_order()`
from `FiniteField_base`, not from `IntegerModRing`.
--
Ticket URL: <http://trac.sagemath.org/ticket/11628#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 unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/groups/opt_out.
