#8558: add a fast gcd algorithm for univariate polynomials over absolute number
fields
------------------------------------------------+---------------------------
Reporter: lftabera | Owner: AlexGhitza
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-5.8
Component: algebra | Resolution:
Keywords: gcd, pari, ntl, number field | Work issues:
Report Upstream: N/A | Reviewers: Jeroen Demeyer
Authors: Luis Felipe Tabera Alonso | Merged in:
Dependencies: #14186 | Stopgaps:
------------------------------------------------+---------------------------
Changes (by lftabera):
* status: needs_work => needs_review
Comment:
Still, we have to look for a sensible default prime p, but the rest of the
ticket can be reviewed.
Further improvements for other tickets and for big degrees could be
* add a half-gcd algorithm for ntl_ZZ_p_EX class, ntl libraries do not
provide one.
* Improve a lot the test of having a gcd, remainder algorithm is slow.
Apply: trac-8558.2.patch
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/8558#comment:24>
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?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
