#18749: Groebner basis computations with the F4 algorithm
-------------------------------------+-------------------------------------
Reporter: tcoladon | Owner:
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-6.8
Component: packages: | Resolution:
optional | Merged in:
Keywords: F4, groebner | Reviewers:
basis, ideal | Work issues:
Authors: Titouan Coladon | Commit:
Report Upstream: N/A | e388b7ef03812fb47c41737fa566ecc97ca89557
Branch: u/malb/t18749_f4 | Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Changes (by dimpase):
* status: needs_review => needs_work
Comment:
There is a bit of mathematical nonsense in the Cython code:
{{{
elif R.characteristic() < 2**32:
}}}
Note that characteristic of a field is always a prime. Please fix the
logic there.
Also, am I correct in thinking that C++ `vector[string]` things there are
allocated on the stack, and are automatically freed, so we don't need to
worry about dealloc?
--
Ticket URL: <http://trac.sagemath.org/ticket/18749#comment:59>
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.
