#15790: GCD of sparse univariate polynomials over ZZ
-------------------------------------+-------------------------------------
Reporter: bruno | Owner:
Type: defect | Status: needs_review
Priority: minor | Milestone: sage-6.4
Component: basic arithmetic | Resolution:
Keywords: sparse | Merged in:
polynomial, gcd | Reviewers:
Authors: Bruno Grenet | Work issues:
Report Upstream: N/A | Commit:
Branch: | 5c84d7115a1e5406487b5d59746554b44be995e4
u/bruno/gcd_of_sparse_univariate_polynomials_over_zz| Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Changes (by bruno):
* status: needs_work => needs_review
Comment:
The ticket is ready for review. Note that as default, I have the "dense"
algorithm for polynomials over ZZ and "pseudo-division" for the other
ones. The idea is that arithmetic on ZZ[X] is very efficient.
Of course, `gcd(x^100000-1,x^1000-1)` is much faster (by a factor approx.
400) with "pseudo-division" algorithm because of memory allocation for the
"dense" algorithm, and thanks to a very good behavior of the "pseudo-
division" algorithm on this example. Yet, if you consider
`gcd(x^100000-1,x^2-1)` (which should be easy btw), the "dense" algorithm
is faster and I even stopped the "pseudo-division" algorithm after a quite
long time.
--
Ticket URL: <http://trac.sagemath.org/ticket/15790#comment:14>
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.
