#10331: degree of semi-regularity
-----------------------------------+----------------------------------------
Reporter: malb | Owner: malb
Type: enhancement | Status: positive_review
Priority: major | Milestone:
Component: commutative algebra | Keywords:
Author: Martin Albrecht | Upstream: N/A
Reviewer: Marshall Hampton | Merged:
Work_issues: |
-----------------------------------+----------------------------------------
Changes (by malb):
* status: needs_review => positive_review
Old description:
> A way of estimating the complexity of Gröbner basis computations for
> random systems is to consider the degree of regularity as an upper bound
> for the degree which will be reached. Thus, it might be helpful for
> multivariate polynomial ideals to have a method for computing the degree
> of semi-regularity.
New description:
A way of estimating the complexity of Gröbner basis computations for
random systems is to consider the degree of regularity as an upper bound
for the degree which will be reached. Thus, it might be helpful for
multivariate polynomial ideals to have a method for computing the degree
of semi-regularity.
'''Apply:''' attachment:trac_10331_reviewer_cumulative.patch
--
Comment:
your patch looks good. I replaced a few non-ascii characters with their
ascii equivalents (text was copied from a pdf, so e.g. "fi" was one
character etc.)
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/10331#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.
