Partitioning a square into rectangles: NP-Completeness and approximation algorithms (Q1849374)
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: Partitioning a square into rectangles: NP-Completeness and approximation algorithms |
scientific article; zbMATH DE number 1837016
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning a square into rectangles: NP-Completeness and approximation algorithms |
scientific article; zbMATH DE number 1837016 |
Statements
Partitioning a square into rectangles: NP-Completeness and approximation algorithms (English)
0 references
1 December 2002
0 references
heterogeneous parallel computing
0 references
