On the Complexity of Two Dots for Narrow Boards and Few Colors. (Q3305725): Difference between revisions

@@ label / en / label / en @@
+On the Complexity of Two Dots for Narrow Boards and Few Colors.
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+TETRIS IS HARD, EVEN TO APPROXIMATE
@@ Property / cites work: TETRIS IS HARD, EVEN TO APPROXIMATE / rank @@
+Normal rank
@@ Property / cites work @@
+Single-Player and Two-Player Buttons &amp; Scissors Games
+Normal rank
@@ Property / cites work @@
+Rush Hour is PSPACE-complete, or ``Why you should generously tip parking lot attendants''
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5282816
@@ Property / cites work: Q5282816 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3395518
@@ Property / cites work: Q3395518 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2831399
@@ Property / cites work: Q2831399 / rank @@
+Normal rank
@@ Property / cites work @@
+Two Dots is NP-complete
@@ Property / cites work: Two Dots is NP-complete / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://dblp.uni-trier.de/db/conf/fun/fun2018.html#BiloG0M18
+Normal rank
@@ Property / OpenAlex ID @@
+W2811134410
@@ Property / OpenAlex ID: W2811134410 / rank @@
+Normal rank
@@ Property / title @@
+On the Complexity of Two Dots for Narrow Boards and Few Colors. (English)
+Normal rank