Deciding the winner in \(k\) rounds for DISJOINT ARROWS, a new combinatorial partizan game (Q391980): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2013.10.004
+Normal rank
@@ Property / OpenAlex ID @@
+W2085397962
@@ Property / OpenAlex ID: W2085397962 / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Undirected edge geography
@@ Property / cites work: Undirected edge geography / rank @@
+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 @@
+GO Is Polynomial-Space Hard
@@ Property / cites work: GO Is Polynomial-Space Hard / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of some two-person perfect-information games
+Normal rank
@@ Property / cites work @@
+Parameterized Chess
@@ Property / cites work: Parameterized Chess / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized pursuit-evasion games
@@ Property / cites work: Parameterized pursuit-evasion games / rank @@
+Normal rank