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 the normal view instead:
scientific article; zbMATH DE number 7233372
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A faster tree-decomposition based algorithm for counting linear extensions |
scientific article; zbMATH DE number 7233372 |
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
0.9789709448814392
0 references
0.8443976640701294
0 references
0.8429738283157349
0 references
