On the complexity of some two-person perfect-information games (Q1248466): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0022-0000(78)90045-4
+Normal rank
@@ Property / OpenAlex ID @@
+W2042714866
@@ Property / OpenAlex ID: W2042714866 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5774938
@@ Property / cites work: Q5774938 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4138187
@@ Property / cites work: Q4138187 / rank @@
+Normal rank
@@ Property / cites work @@
+A Combinatorial Problem Which Is Complete in Polynomial Space
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q3239652
@@ Property / cites work: Q3239652 / rank @@
+Normal rank
@@ Property / cites work @@
+Space-bounded reducibility among combinatorial problems
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4157951
@@ Property / cites work: Q4157951 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3888985
@@ Property / cites work: Q3888985 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4131648
@@ Property / cites work: Q4131648 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4099541
@@ Property / cites work: Q4099541 / rank @@
+Normal rank