Abstract
We survey the problem of counting the number of linear extensions of a partially ordered set. We show that this problem is #P-complete, settling a long-standing open question. This result is contrasted with recent work giving randomized polynomial-time algorithms for estimating the number of linear extensions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have