#18749: Groebner basis computations with openf4 package
-------------------------------------+-------------------------------------
Reporter: tcoladon | Owner:
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-7.0
Component: packages: | Resolution:
optional | Merged in:
Keywords: F4, groebner | Reviewers: Martin Albrecht,
basis, ideal | Travis Scrimshaw, Jeroen Demeyer,
Authors: Titouan Coladon | Dima Pasechnik
Report Upstream: N/A | Work issues: default algorithm
Branch: u/jdemeyer/f4 | choice
Dependencies: | Commit:
| 0da1853a76d06188a2cd6f608c6b3df406259cea
| Stopgaps:
-------------------------------------+-------------------------------------
Changes (by jdemeyer):
* status: needs_review => needs_work
* work_issues: => default algorithm choice
* milestone: sage-6.8 => sage-7.0
Comment:
Another thing: if `openf4` is so much faster like you claim, it should be
the default algorithm for Gröbner basis computations over rings which
`openf4` can handle. That would also greatly increase the testing
coverage.
--
Ticket URL: <http://trac.sagemath.org/ticket/18749#comment:84>
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.
