#20220: GCD of polyomials over polynomial rings
-----------------------------------+-----------------------------------
Reporter: bruno | Owner:
Type: PLEASE CHANGE | Status: new
Priority: major | Milestone: sage-7.1
Component: commutative algebra | Keywords: gcd, polynomial
Merged in: | Authors: Bruno Grenet
Reviewers: | Report Upstream: N/A
Work issues: | Branch:
Commit: | Dependencies:
Stopgaps: |
-----------------------------------+-----------------------------------
In this ticket, we add a mechanism for computing GCD of polynomials over
polynomial ring: For instance, to compute the gcd of polynomials in `x`
over `QQ['y']`, we use the implementation of GCD in `QQ['x,y']`. This
fasten a lot the computations.
--
Ticket URL: <http://trac.sagemath.org/ticket/20220>
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 https://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
