#14126: Count Number of Linear Extensions of a Poset
-------------------------------------+-------------------------------------
Reporter: csar | Owner: sage-combinat
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-6.4
Component: combinatorics | Resolution:
Keywords: days45 | Merged in:
Authors: aschilling, | Reviewers:
nthiery, hivert | Work issues:
Report Upstream: N/A | Commit:
Branch: u/jmantysalo | f908696aa7c63cefbc382af326cfe085e0dfa522
/count-lin-ext | Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by jmantysalo):
Pinging this one...
About faster algorithms: I am quite sure that we can do better in some
cases. For example if you do a series-parallel decomposition, then
counting can be done to indecomposable parts and just summed up with
simpler formula.
But still, this is proven to be `#P`.
--
Ticket URL: <http://trac.sagemath.org/ticket/14126#comment:24>
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 https://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
