Author:
Soltys Michael,Wilson Craig
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference16 articles.
1. Bouton, C.L.: Nim, a game with a complete mathematical theory. Ann. Math. 3(1/4), 35–39 (1902)
2. Gale, D.: A curious nim-type game. Am. Math. Mon. 81(8), 876–879 (1974)
3. Schäfer, T.J.: Complexity of some two-person perfect-information games. J. CSS 16, 185–225 (1978)
4. Skelley, A.: A third-order bounded arithmetic theory for PSPACE. In: Computer Science Logic, 18th International Workshop, pp. 340–354 (2004)
5. Úlehla, J.: A complete analysis of Von Neumann’s Hackendot. Int. J. Game Theory 9, 107–113 (1980)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献