Rectangular partition is polynomial in two dimensions but NP-complete in three (Q808703): Difference between revisions

@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / cites work @@
+Covering Regions by Rectangles
@@ Property / cites work: Covering Regions by Rectangles / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3948588
@@ Property / cites work: Q3948588 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding a manhattan path and related problems
@@ Property / cites work: Finding a manhattan path and related problems / rank @@
+Normal rank
@@ Property / cites work @@
+Some NP-hard polygon decomposition problems
@@ Property / cites work: Some NP-hard polygon decomposition problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q3893361
@@ Property / cites work: Q3893361 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(91)90207-x
+Normal rank
@@ Property / OpenAlex ID @@
+W2027668079
@@ Property / OpenAlex ID: W2027668079 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:808703