On the computational complexity of the order polynomial (Q1086595)
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 3985284
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the computational complexity of the order polynomial |
scientific article; zbMATH DE number 3985284 |
Statements
On the computational complexity of the order polynomial (English)
0 references
1986
0 references
Efficient algorithms for computing the order polynomial for the classes of orders with bounded width and series-parallel orders are presented. It is proved that for any fixed i the i-th coefficient of the order polynomial can be computed in polynomial time for the class of semiorders.
0 references
computational complexity
0 references
order polynomial
0 references
orders with bounded width
0 references
series-parallel orders
0 references
polynomial time
0 references
semiorders
0 references
0 references
0 references
0.7518033981323242
0 references
0.7458093166351318
0 references
