Mathematical characterizations and computational complexity of anti-slide puzzles (Q5918568): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2022.10.026
+Normal rank
@@ Property / OpenAlex ID @@
+W4308483689
@@ Property / OpenAlex ID: W4308483689 / rank @@
+Normal rank
@@ Property / cites work @@
+Symmetric assembly puzzles are hard, beyond a few pieces
+Normal rank
@@ Property / cites work @@
+Q4313096
@@ Property / cites work: Q4313096 / rank @@
+Normal rank
@@ Property / cites work @@
+Any monotone function is realized by interlocked polygons
+Normal rank
@@ Property / cites work @@
+Q5452284
@@ Property / cites work: Q5452284 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Covering convex sets with non-overlapping polygons
+Normal rank
@@ Property / cites work @@
+Q5427478
@@ Property / cites work: Q5427478 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5918568