#7931: Improved nth root for finite fields and integer_mods
---------------------------+------------------------------------------------
Reporter: roed | Owner: AlexGhitza
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-4.3.1
Component: algebra | Keywords: finite fields, nth root
Work_issues: | Author: David Roe
Upstream: N/A | Reviewer:
Merged: |
---------------------------+------------------------------------------------
Changes (by roed):
* status: new => needs_review
Old description:
> Implements an algorithm described in
> {{
> Johnston, Anna M. A generalized qth root algorithm.
> Proceedings of the tenth annual ACM-SIAM symposium on Discrete
> algorithms.
> Baltimore, 1999: pp 929-930.
> }}}
>
> This means we can take nth roots with large n, since we no longer need to
> create the polynomial x^n-a.
New description:
Implements an algorithm described in
{{{
Johnston, Anna M. A generalized qth root algorithm.
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms.
Baltimore, 1999: pp 929-930.
}}}
This means we can take nth roots with large n, since we no longer need to
create the polynomial x^n^ - a.
--
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7931#comment:1>
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.
