Affine scheduling on bounded convex polyhedric domains is asymptotically optimal (Q1128739): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4501868 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some efficient solutions to the affine scheduling problem. I: One- dimensional time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some efficient solutions to the affine scheduling problem. II: Multidimensional time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Organization of Computations for Uniform Recurrence Equations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3818127 / rank | |||
Normal rank | |||
Revision as of 14:45, 28 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Affine scheduling on bounded convex polyhedric domains is asymptotically optimal |
scientific article |
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
