#13850: PolynomialSequence.solve()
---------------------------------------+------------------------------------
Reporter: malb | Owner: malb
Type: enhancement | Status: new
Priority: major | Milestone: sage-5.6
Component: commutative algebra | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: | Merged in:
Dependencies: | Stopgaps:
---------------------------------------+------------------------------------
Description changed by malb:
Old description:
> Polynomial sequences over GF(2) should have a solve method which supports
> solving via
>
> * Gröbner bases (!PolyBoRi)
> * SAT solving (!CryptoMiniSat and friends)
> * exhaustive search (FES library)
> * (Mixed Integer Programming) (!Sage's MIP stuff and !SCIP)
>
> All these interfaces exist, they only need to be properly exposed.
New description:
Polynomial sequences over GF(2) should have a solve method which supports
solving via
* Gröbner bases (!PolyBoRi)
* SAT solving (!CryptoMiniSat and friends)
* exhaustive search (FES library)
* (Mixed Integer Programming) (Sage's MIP stuff and SCIP)
All these interfaces exist, they only need to be properly exposed.
--
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13850#comment:1>
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.
