Rectangular partition is polynomial in two dimensions but NP-complete in three (Q808703)
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: Rectangular partition is polynomial in two dimensions but NP-complete in three |
scientific article; zbMATH DE number 4211502
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Rectangular partition is polynomial in two dimensions but NP-complete in three |
scientific article; zbMATH DE number 4211502 |
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
0 references
0.8333009
0 references
0.8298296
0 references
0.8298296
0 references
0.8266834
0 references
0.8236556
0 references
0.81523454
0 references
