#8558: add a fast gcd algorithm for univariate polynomials over absolute number
fields
---------------------------+------------------------------------------------
Reporter: lftabera | Owner: AlexGhitza
Type: enhancement | Status: needs_info
Priority: major | Milestone: sage-4.7
Component: algebra | Keywords: gcd, pari, ntl, number field
Work_issues: | Upstream: N/A
Reviewer: | Author: Luis Felipe Tabera Alonso
Merged: | Dependencies:
---------------------------+------------------------------------------------
Changes (by malb):
* status: needs_review => needs_info
Comment:
Hi, I don't know much about fast computation in polynomial rings over
number fields. However, I'm wondering why you have this bias towards
functions as opposed to methods? For example, {{{lift_pm}}} looks like it
should be a method on {{{p}}} instead of a function? Perhaps the same
applies to the gcd functions? Or am I missing something?
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/8558#comment:11>
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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
