#16516: Faster roots computation for sparse polynomials over ZZ
-------------------------------------+-------------------------------------
Reporter: bruno | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.3
Component: commutative | Resolution:
algebra | Merged in:
Keywords: roots, sparse | Reviewers:
polynomial | Work issues:
Authors: | Commit:
Report Upstream: N/A | 920c16e8952cb1f885c1fd1f3bcdfd5d572c17fe
Branch: | Stopgaps:
u/bruno/faster_roots_computation_for_sparse_polynomials_over_zz|
Dependencies: |
-------------------------------------+-------------------------------------
Changes (by bruno):
* status: new => needs_review
* commit: => 920c16e8952cb1f885c1fd1f3bcdfd5d572c17fe
Old description:
> 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 and over QQ.
New description:
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#comment:3>
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.
