A subexponential upper bound for the on-line chain partitioning problem (Q276436)
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 subexponential upper bound for the on-line chain partitioning problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A subexponential upper bound for the on-line chain partitioning problem |
scientific article |
Statements
A subexponential upper bound for the on-line chain partitioning problem (English)
0 references
3 May 2016
0 references
