Classic Nintendo games are (computationally) hard (Q2347007): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2015.02.037
@@ Property / DOI: 10.1016/j.tcs.2015.02.037 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2015.02.037
+Normal rank
@@ Property / OpenAlex ID @@
+W1749523692
@@ Property / OpenAlex ID: W1749523692 / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Complexity of Two-Dimensional Platform Games
+Normal rank
@@ Property / cites work @@
+Gaming is a hard job, but someone has to do it!
@@ Property / cites work: Gaming is a hard job, but someone has to do it! / rank @@
+Normal rank
@@ Property / cites work @@
+Lemmings is PSPACE-complete
@@ Property / cites work: Lemmings is PSPACE-complete / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2015.02.037
@@ Property / DOI: 10.1016/J.TCS.2015.02.037 / rank @@
+Normal rank