A faster tree-decomposition based algorithm for counting linear extensions (Q786030)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A faster tree-decomposition based algorithm for counting linear extensions |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A faster tree-decomposition based algorithm for counting linear extensions |
scientific article |
Statements
A faster tree-decomposition based algorithm for counting linear extensions (English)
0 references
12 August 2020
0 references
algorithm selection
0 references
empirical hardness
0 references
linear extension
0 references
multiplication of polynomials
0 references
tree decomposition
0 references
0 references
