论文信息 - Theory of annihilation games—I☆ - 字舞流文

Theory of annihilation games—I☆

A. Fraenkel | Y. Yesha

[1] Cedric A. B. Smith. Graphs and composite games , 1966 .

[2] Aviezri S. Fraenkel,et al. Strategy for a class of games with dynamic ties , 1975 .

[3] Aviezri S. Fraenkel,et al. Theory of annihilation games , 1976 .

[4] Robert E. Tarjan,et al. A Combinatorial Problem Which Is Complete in Polynomial Space , 1976, JACM.

[5] Thomas J. Schaefer,et al. On the Complexity of Some Two-Person Perfect-Information Games , 1978, J. Comput. Syst. Sci..

[6] Aviezri S. Fraenkel,et al. Three Annihilation Games , 1978 .

[7] David S. Johnson,et al. The complexity of checkers on an N × N board , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[8] Aviezri S. Fraenkel,et al. Complexity of problems in games, graphs and algebraic equations , 1979, Discret. Appl. Math..

[9] A. K. Chandra,et al. Provably Difficult Combinatorial Games , 1979, SIAM J. Comput..

[10] David Lichtenstein,et al. GO Is Polynomial-Space Hard , 1980, JACM.

[11] Aviezri S. Fraenkel,et al. Computing a Perfect Strategy for n x n Chess Requires Time Exponential in n , 1981, J. Comb. Theory, Ser. A.