1. S. Aida and T. Tsukiji, Complexity of two person games with unique winning strategy, Technical Report of IEICE COMP2000-87, 2001.
2. A.K. Chandra and L.J. Stockmeyer, Provably difficult combinatorial games, SIAM J. Comput., 8, 151–174, 1979.
3. Lect Notes Comput Sci;M. Crasmaru,2001
4. M. Crasmaru, PSPACE versus EXP-TIME and the game of GO, Master Thesis, Tokyo Institute of Technology, 2001.
5. S. Fenner, L. Fortnow, and S. Kurtz, Gap-definable counting classes, J. Comp. Sys. Sci., 48 116–184, 1994.