Defying gravity and gadget numerosity: the complexity of the Hanano puzzle (Q6175086): Difference between revisions

@@ Property / cites work @@
+Q4407717
@@ Property / cites work: Q4407717 / 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 @@
+Super Mario Bros. Is Harder/Easier than We Thought
+Normal rank
@@ Property / cites work @@
+PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
+Normal rank
@@ Property / cites work @@
+Q3395518
@@ Property / cites work: Q3395518 / rank @@
+Normal rank
@@ Property / cites work @@
+\textsc{Hanano} puzzle is \textsf{NP}-hard
@@ Property / cites work: \textsc{Hanano} puzzle is \textsf{NP}-hard / rank @@
+Normal rank
@@ Property / cites work @@
+Q3102944
@@ Property / cites work: Q3102944 / rank @@
+Normal rank
@@ Property / cites work @@
+A unified approach to visibility representations of planar graphs
+Normal rank
@@ Property / cites work @@
+On the complexity of jelly-no-puzzle
@@ Property / cites work: On the complexity of jelly-no-puzzle / rank @@
+Normal rank
@@ Property / cites work @@
+Walking through doors is hard, even without staircases: proving PSPACE-hardness via planar assemblies of door gadgets
+Normal rank