On the complexity of computing winning strategies for finite poset games (Q537910): Difference between revisions

@@ Property / cites work @@
+A Curious Nim-Type Game
@@ Property / cites work: A Curious Nim-Type Game / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of some two-person perfect-information games
+Normal rank
@@ Property / cites work @@
+Computer Science Logic
@@ Property / cites work: Computer Science Logic / rank @@
+Normal rank
@@ Property / cites work @@
+A complete analysis of von Neumann's Hackendot
@@ Property / cites work: A complete analysis of von Neumann's Hackendot / rank @@
+Normal rank
@@ Property / cites work @@
+Q2703803
@@ Property / cites work: Q2703803 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4762155
@@ Property / cites work: Q4762155 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3221403
@@ Property / cites work: Q3221403 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3392275
@@ Property / cites work: Q3392275 / rank @@
+Normal rank
@@ Property / cites work @@
+Three-rowed CHOMP
@@ Property / cites work: Three-rowed CHOMP / rank @@
+Normal rank
@@ Property / cites work @@
+Q4530293
@@ Property / cites work: Q4530293 / rank @@
+Normal rank
@@ Property / cites work @@
+Nonlinear dynamics in combinatorial games: Renormalizing Chomp
+Normal rank
@@ Property / cites work @@
+Q4831470
@@ Property / cites work: Q4831470 / rank @@
+Normal rank