Rectangular partition is polynomial in two dimensions but NP-complete in three (Q808703): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Covering Regions by Rectangles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3948588 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finding a manhattan path and related problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some NP-hard polygon decomposition problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3893361 / rank | |||
Normal rank | |||
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