Theory of annihilation games—I
Authors:
- A.S FraenkelAFA.S Fraenkel
- Y YeshaYYY Yesha
- 1 August 1982
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 33 (1) , 60-86
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Computing a perfect strategy for n × n chess requires time exponential in nJournal of Combinatorial Theory, Series A, 1981
- Hex ist PSPACE-vollst ndigActa Informatica, 1981
- GO Is Polynomial-Space HardJournal of the ACM, 1980
- Gobang ist PSPACE-vollst ndigActa Informatica, 1980
- Complexity of problems in games, graphs and algebraic equationsDiscrete Applied Mathematics, 1979
- On the complexity of some two-person perfect-information gamesJournal of Computer and System Sciences, 1978
- Three Annihilation GamesMathematics Magazine, 1978
- A Combinatorial Problem Which Is Complete in Polynomial SpaceJournal of the ACM, 1976
- Theory of annihilation gamesBulletin of the American Mathematical Society, 1976
- Graphs and composite gamesJournal of Combinatorial Theory, 1966