Geography (Q1210545): Difference between revisions

@@ Property / cites work @@
+Complexity of path-forming games
@@ Property / cites work: Complexity of path-forming games / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+A Solution of the Shannon Switching Game
@@ Property / cites work: A Solution of the Shannon Switching Game / rank @@
+Normal rank
@@ Property / cites work @@
+Planar Formulae and Their Uses
@@ Property / cites work: Planar Formulae and Their Uses / rank @@
+Normal rank
@@ Property / cites work @@
+GO Is Polynomial-Space Hard
@@ Property / cites work: GO Is Polynomial-Space Hard / rank @@
+Normal rank
@@ Property / cites work @@
+Playing disjunctive sums is polynomial space complete
+Normal rank
@@ Property / cites work @@
+Prohibiting repetitions makes playing games substantially harder
+Normal rank
@@ Property / cites work @@
+Hex ist Pspace-vollständig. (Hex is Pspace-complete)
+Normal rank
@@ Property / cites work @@
+Q3721817
@@ Property / cites work: Q3721817 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of some two-person perfect-information games
+Normal rank