#13223: Implement Poset.is_graded using a polynomial time (linear?) algorithm.
-------------------------------------+-------------------------------------
Reporter: nthiery | Owner: sage-combinat
Type: enhancement | Status: positive_review
Priority: minor | Milestone: sage-
Component: combinatorics | duplicate/invalid/wontfix
Keywords: sd40 | Resolution:
Authors: Jori Mäntysalo | Merged in:
Report Upstream: N/A | Reviewers:
Branch: | Work issues:
u/jmantysalo/implement_poset_is_graded_using_a_polynomial_time__linear___algorithm_|
Commit:
Dependencies: #13222 | a9896c7e9f9e8e6c6f52a25a3370c2d595e2fecf
| Stopgaps:
-------------------------------------+-------------------------------------
Changes (by jmantysalo):
* status: needs_work => positive_review
* milestone: sage-6.4 => sage-duplicate/invalid/wontfix
Comment:
As current algorithm already is `O(n)` with small constant factor, and
Nathann also suggest closing this, I mark this ticket as dontfix-
positive_review.
Todo-note from `posets.py` must also be removed. However, I can do that on
#16998.
--
Ticket URL: <http://trac.sagemath.org/ticket/13223#comment:20>
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.
