#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:
-------------------------------------+-------------------------------------

Comment (by darij):

 Sorry for the confusion that came from me. When I said that "Wouldn't hurt
 to improve it nevertheless", I didn't have any particular improvements in
 mind, just an impression that I wasn't being very thorough. And I think it
 wasn't exactly my algorithm that got implemented in Sage, but rather an
 improved version by Anne(?) and Nicolas(?).

--
Ticket URL: <http://trac.sagemath.org/ticket/13223#comment:21>
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.

Reply via email to