#15790: GCD of sparse univariate polynomials over ZZ
------------------------------------+------------------------
Reporter: bruno | Owner:
Type: defect | Status: new
Priority: minor | Milestone: sage-6.0
Component: basic arithmetic | Resolution:
Keywords: GCD sparse | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: | Stopgaps:
------------------------------------+------------------------
Comment (by tscrim):
I'd implement all 3 with an optional `algorithm` argument since each has
different strengths/weaknesses. For example, 2 is good as long as the
polynomials are relatively dense, but for something like `x^100000 - 2`, I
wouldn't want to convert that to a dense polynomial because of the memory
usage (and take the time to construct it). From that, I think 3 should be
the default. Possible names:
1. `"fraction_field"`
2. `"dense"`
3. `"pseudo-division"`
Nevertheless, I think we should have some `gcd` since this would be a
surprise for the more casual user.
--
Ticket URL: <http://trac.sagemath.org/ticket/15790#comment:2>
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/groups/opt_out.
