Affine scheduling on bounded convex polyhedric domains is asymptotically optimal (Q1128739)
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 1189979
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Affine scheduling on bounded convex polyhedric domains is asymptotically optimal |
scientific article; zbMATH DE number 1189979 |
Statements
Affine scheduling on bounded convex polyhedric domains is asymptotically optimal (English)
0 references
13 August 1998
0 references
automatic parallelization
0 references
longest path in a graph
0 references
linear programming
0 references
0.8635642528533936
0 references
0.8248181343078613
0 references
0.8079422116279602
0 references
