Partitioning a square into rectangles: NP-Completeness and approximation algorithms (Q1849374): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:03, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning a square into rectangles: NP-Completeness and approximation algorithms |
scientific article |
Statements
Partitioning a square into rectangles: NP-Completeness and approximation algorithms (English)
0 references
1 December 2002
0 references
heterogeneous parallel computing
0 references
