On the complexity of chess (Q1054641): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0022-0000(83)90030-2
+Normal rank
@@ Property / OpenAlex ID @@
+W2015319564
@@ Property / OpenAlex ID: W2015319564 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4773298
@@ Property / cites work: Q4773298 / rank @@
+Normal rank
@@ Property / cites work @@
+A Combinatorial Problem Which Is Complete in Polynomial Space
+Normal rank
@@ Property / cites work @@
+Computing a perfect strategy for nxn chess requires time exponential in n
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Planarity Testing
@@ Property / cites work: Efficient Planarity Testing / rank @@
+Normal rank
@@ Property / cites work @@
+Q4131648
@@ Property / cites work: Q4131648 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4157951
@@ Property / cites work: Q4157951 / rank @@
+Normal rank