#13629: provide xgcd for new polynomial rings through
_xgcd_univariate_polynomial
-------------------------------------+-------------------------------------
Reporter: saraedum | Owner: AlexGhitza
Type: task | Status: needs_work
Priority: minor | Milestone: sage-6.4
Component: basic arithmetic | Resolution:
Keywords: sd59 | Merged in:
Authors: Julian Rueth | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/pbruin/13629-xgcd_univariate_polynomial|
011592eac5427af20416fc5eb8c424d9723f5876
Dependencies: #13628, #18461 | Stopgaps:
-------------------------------------+-------------------------------------
Changes (by pbruin):
* commit: a3d778fd433b34edd55e4ccd87400969652830b2 =>
011592eac5427af20416fc5eb8c424d9723f5876
* branch: u/saraedum/ticket/13629 =>
u/pbruin/13629-xgcd_univariate_polynomial
Comment:
The current branch passes all tests. However, I'm wondering whether
`Field._xgcd_univariate_polynomial` shouldn't be implemented as well (cf.
#18461) for performance reasons.
--
Ticket URL: <http://trac.sagemath.org/ticket/13629#comment:22>
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.
