#20220: GCD of polyomials over polynomial rings
-------------------------------------+-------------------------------------
Reporter: bruno | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-7.1
Component: commutative | Resolution:
algebra | Merged in:
Keywords: gcd, polynomial, | Reviewers: Aly Deines
days71 | Work issues:
Authors: Bruno Grenet | Commit:
Report Upstream: N/A | 2fb18365da045c85ee185cffb4d76d18e89f9b8f
Branch: | Stopgaps:
u/bruno/gcd_polys_polyrings |
Dependencies: |
-------------------------------------+-------------------------------------
Changes (by bruno):
* status: needs_work => needs_review
Comment:
My three commits should correct the problems noticed above. The problem
mentioned in the "'''[edit]'''" part of comment:5 is corrected by the
latest commit: Instead of trying to use the generic method `gcd` for
multivariate polynomials, it directly tests whether Singular can perform
the computation.
My main concern now is performance: At some point, I run tests that were
very slow, but I am not able to reproduce the behavior anymore. That's why
I put Needs Review: Please perform tests to see whether my changes imply
slowdown in some parts. It should'nt...
--
Ticket URL: <http://trac.sagemath.org/ticket/20220#comment:10>
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.
