#8558: add a fast gcd algorithm for univariate polynomials over absolute number
fields
-------------------------------------+-------------------------------------
Reporter: lftabera | Owner: AlexGhitza
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-6.3
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 | f57b6514c42c431a3849d28703b6fce105f25a5d
Branch: | Stopgaps:
u/lftabera/ticket/8558 |
Dependencies: #14186, #15803, |
#15804 |
-------------------------------------+-------------------------------------
Comment (by lftabera):
Thanks anyway, this made me update my local branches :)
The code is ok, but the branch of patches is a little mess due to my poor
"git-fu". As of now I think that it is more important to get the
dependencies merged, they are much simpler and would allow to prepare
cleaner patches for this ticket.
Concerning #13442, I had in mind an implementation of these rings as in
ticket #10591, so it would be better to have different classes for
polynomials over number fields. The long term goal would be to have nice
multiple extensions without the need of computing a primitive element for
basic arithmetic, IMO it would be faster than using singular (cf. #9541).
--
Ticket URL: <http://trac.sagemath.org/ticket/8558#comment:43>
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/d/optout.
