Rectangular partition is polynomial in two dimensions but NP-complete in three (Q808703): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(91)90207-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2027668079 / rank | |||
Normal rank | |||
Latest revision as of 09:08, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Rectangular partition is polynomial in two dimensions but NP-complete in three |
scientific article |
Statements
Rectangular partition is polynomial in two dimensions but NP-complete in three (English)
0 references
1991
0 references
polygon decomposition
0 references
NP-complete
0 references
