#13223: Implement Poset.is_graded using a polynomial time (linear?) algorithm.
---------------------------------+-----------------------------
Reporter: nthiery | Owner: sage-combinat
Type: enhancement | Status: new
Priority: major | Milestone: sage-5.13
Component: combinatorics | Resolution:
Keywords: sd40 | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: #13222 | Stopgaps:
---------------------------------+-----------------------------
Comment (by darij):
I've improved the situation in #13240; the algorithm is now polynomial
time. Wouldn't hurt to improve it nevertheless.
--
Ticket URL: <http://trac.sagemath.org/ticket/13223#comment:4>
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/groups/opt_out.
