Generalized Pete's Pike is PSPACE-complete (Q899314): Difference between revisions

@@ Property / cites work @@
+Randolphs Robot Game is NP-hard!
@@ Property / cites work: Randolphs Robot Game is NP-hard! / rank @@
+Normal rank
@@ Property / cites work @@
+Rush Hour is PSPACE-complete, or ``Why you should generously tip parking lot attendants''
+Normal rank
@@ Property / cites work @@
+Computational Complexity of Two-Dimensional Platform Games
+Normal rank
@@ Property / cites work @@
+Q4435431
@@ Property / cites work: Q4435431 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3395518
@@ Property / cites work: Q3395518 / rank @@
+Normal rank
@@ Property / cites work @@
+Assembling molecules in ATOMIX is hard
@@ Property / cites work: Assembling molecules in ATOMIX is hard / rank @@
+Normal rank
@@ Property / cites work @@
+Q4797430
@@ Property / cites work: Q4797430 / rank @@
+Normal rank
@@ Property / cites work @@
+Relationships between nondeterministic and deterministic tape complexities
+Normal rank
@@ Property / cites work @@
+Fun with algorithms. 6th international conference, FUN 2012, Venice, Italy, June 4--6, 2012. Proceedings
+Normal rank