#15790: GCD of sparse univariate polynomials over ZZ
-------------------------------------+-------------------------------------
Reporter: bruno | Owner:
Type: defect | Status: new
Priority: minor | Milestone: sage-6.3
Component: basic arithmetic | Resolution:
Keywords: GCD sparse | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/bruno/gcd_of_sparse_univariate_polynomials_over_zz|
8ddbb9efad8d53552fa26727fb484720bda66025
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by bruno):
I've implemented the `gcd` method in the class `Polynomial` using the
pseudo-division algorithm, as well as a method `gcd` in
`Polynomial_generic_sparse` which allows to choose the algorithm between
`"pseudo-division"`, `"dense"` or `"fraction_field"`.
Needs review!
One remaining limitation is the absence of `quo_rem` method in
`Polynomial_generic_sparse`. I created a specific ticket #16544 for this.
--
Ticket URL: <http://trac.sagemath.org/ticket/15790#comment:7>
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.
