#11036: improve solve_mod performance
----------------------------+-----------------------------------------------
Reporter: dsm | Owner: burcin
Type: enhancement | Status: needs_review
Priority: minor | Milestone: sage-4.7.2
Component: symbolics | Keywords: modular arithmetic
Work_issues: | Upstream: N/A
Reviewer: John Cremona | Author:
Merged: | Dependencies:
----------------------------+-----------------------------------------------
Changes (by cremona):
* keywords: => modular arithmetic
* reviewer: => John Cremona
* status: needs_work => needs_review
* milestone: => sage-4.7.2
Comment:
I did a rebase but also have managed to mess up my 4.7.1.rc[01] builds
while testing other tickets, so no guarantees...
The code seems to assume that the expressions is a polynomial (in one or
more variables), so there should definitely be a more efficient way to do
the enumeration of solutions modulo prime powers -- this should be a
linear (algebra mod p) problem once the solutions mod p are known, right?
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/11036#comment:5>
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.
