Breaking the 2ⁿ Barrier for Counting Linear Extensions with a Short Elementary Algorithm
- Theoretical Computer Science
A deterministic exact algorithm counts linear extensions of any n-element poset in O*(1.89^n) time.
Counting linear extensions below 2^n
- Theoretical Computer Science
Can the linear extensions of every n-element poset be counted exactly in time O*(c^n) for a constant c<2?
Curated contributions 1
Understand the problem ↓Understanding the problem
Read the background
Can the linear extensions of every n-element poset be counted exactly in time O*(c^n) for a constant c<2?
Why it matters
The problem concerns a general exact counting algorithm, rather than a restricted class of posets.
What counts as progress
Can the linear extensions of every n-element poset be counted exactly in time O*(c^n) for a constant c<2?
Website timeline
Publication dates and editorial changes.