#16516: Faster roots computation for sparse polynomials over ZZ
------------------------------+--------------------------------------------
Reporter: bruno | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-6.3
Component: commutative | Keywords: roots, sparse polynomial
algebra | Authors:
Merged in: | Report Upstream: N/A
Reviewers: | Branch:
Work issues: | Dependencies:
Commit: |
Stopgaps: |
------------------------------+--------------------------------------------
Algorithms exist for the computation of the roots of sparse polynomials,
which are much faster than the "generic" algorithms which work for dense
polynomials.
In this ticket, I implement one of these algorithms, for integer roots of
sparse polynomials over ZZ.
--
Ticket URL: <http://trac.sagemath.org/ticket/16516>
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.
