Q3305736 (Q3305736): Difference between revisions

@@ Property / DOI @@
-.4230/LIPIcs.FUN.2018.18
@@ Property / DOI: 10.4230/LIPIcs.FUN.2018.18 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.03539
@@ Property / arXiv ID: 1806.03539 / rank @@
+Normal rank
@@ Property / cites work @@
+Classic Nintendo games are (computationally) hard
@@ Property / cites work: Classic Nintendo games are (computationally) hard / rank @@
+Normal rank
@@ Property / cites work @@
+How to draw a planar graph on a grid
@@ Property / cites work: How to draw a planar graph on a grid / rank @@
+Normal rank
@@ Property / cites work @@
+Pushing blocks is hard.
@@ Property / cites work: Pushing blocks is hard. / rank @@
+Normal rank
@@ Property / cites work @@
+Push-Pull Block Puzzles are Hard
@@ Property / cites work: Push-Pull Block Puzzles are Hard / rank @@
+Normal rank
@@ Property / cites work @@
+Super Mario Bros. Is Harder/Easier than We Thought
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3395518
@@ Property / cites work: Q3395518 / rank @@
+Normal rank
@@ Property / cites work @@
+\textsc{Pull} and \textsc{PushPull} are PSPACE-complete
+Normal rank
@@ Property / cites work @@
+Relationships between nondeterministic and deterministic tape complexities
+Normal rank
@@ Property / cites work @@
+The complexity of satisfiability problems
@@ Property / cites work: The complexity of satisfiability problems / rank @@
+Normal rank
@@ Property / DOI @@
+.4230/LIPICS.FUN.2018.18
@@ Property / DOI: 10.4230/LIPICS.FUN.2018.18 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3305736