#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-6.1
Component: algebra | Resolution:
Keywords: gcd, pari, ntl, | Merged in:
number field | Reviewers: Jeroen Demeyer
Authors: Luis Felipe | Work issues:
Tabera Alonso | Commit:
Report Upstream: N/A | 85ff4b9e6b8db9019eb7f4720851878966eecf77
Branch: | Stopgaps:
u/lftabera/ticket/8558 |
Dependencies: #14186 |
-------------------------------------+-------------------------------------
Comment (by jdemeyer):
Certainly looks in much better shape than it used to be, but I'm afraid I
don't know enough NTL to completely review this. Why not split up this
ticket in two? The first which adds the new classes and implements `gcd`
via PARI and the second which implements the modular algorithm.
--
Ticket URL: <http://trac.sagemath.org/ticket/8558#comment:34>
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.
