#8558: add a fast gcd algorithm for univariate polynomials over absolute number
fields
-------------------------------------+-------------------------------------
Reporter: lftabera | Owner: AlexGhitza
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-6.4
Component: algebra | Resolution:
Keywords: gcd, pari, ntl, | Merged in:
number field |
Authors: Luis Felipe | Reviewers: Jeroen Demeyer
Tabera Alonso |
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/lftabera/ticket/8558 | eef9fe12ac4578b08fbff4b8ca5264ad5e20a8b9
Dependencies: #14186, #15803, | Stopgaps:
#15804 |
-------------------------------------+-------------------------------------
Comment (by cremona):
One thing to watch when comparing timings with pari is that when Sage
calls pari to compute class number s and units in a number field, unless
Proof=False it assumes no hypothesis (like GRH) so is often a lot slower
than the same thing done in pari, where the default is to assume
everything (and you can ask for certification later). This should be as
issue if you only do basic number field arithmetic, but if you do anything
which requires knowing the units or class group it can be quite
significant. You might want to try setting Proof=False in Sage and seeing
if your timings change.
--
Ticket URL: <https://trac.sagemath.org/ticket/8558#comment:57>
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.
