Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference10 articles.
1. The Design and Analysis of Computer Algorithms;Aho,1974
2. Alternation;Chandra,1976
3. A combinatorial game which is complete in polynomial space;Even;J. Assoc. Comput. Mach.,1976
4. Computing a perfect strategy for NxN chess requires time exponential in N;Fraenkel;J. Combin. Theory Ser. A,1981
5. The complexity of checkers on an NxN Board—Preliminary Report;Fraenkel,1978
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Chess Equilibrium Puzzles;Mathematics Magazine;2023-07-19
2. Rationality as the end of thought;Behavioral and Brain Sciences;2022
3. Credimus;The Future of Economic Design;2019
4. Rating Computer Science via Chess;Lecture Notes in Computer Science;2019
5. The complexity of online voter control in sequential elections;Autonomous Agents and Multi-Agent Systems;2016-11-10