Theory of annihilation games. I
type: Item
instance of: scholarly article
title: Theory of annihilation games. I
zbMATH Open document ID: 0493.90099
DOI: 10.1016/0095-8956(82)90058-2
author: Aviezri S. Fraenkel
author: Yaacov Yesha
published in: Journal of Combinatorial Theory. Series B
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 91A24
Mathematics Subject Classification ID: 91A05
zbMATH DE Number: 3777294
zbMATH Keywords: annihilation games
zbMATH Keywords: finite digraph
zbMATH Keywords: algorithm
zbMATH Keywords: computation of winning positions
zbMATH Keywords: computation of best strategies
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: 0095-8956(82)90058-2
OpenAlex ID: W1971342303
cites work: Q4091421
cites work: Q5679731
cites work: Q3941433
cites work: A Combinatorial Problem Which Is Complete in Polynomial Space
cites work: Q4770810
cites work: Computing a perfect strategy for nxn chess requires time exponential in n
cites work: Q4099857
cites work: Three Annihilation Games
cites work: Theory of annihilation games
cites work: Complexity of problems in games, graphs and algebraic equations
cites work: Q4198056
cites work: Q5585020
cites work: GO Is Polynomial-Space Hard
cites work: Q5603271
cites work: Gobang is PSPACE-complete
cites work: Hex ist Pspace-vollständig. (Hex is Pspace-complete)
cites work: On the complexity of some two-person perfect-information games
cites work: Graphs and composite games
cites work: Provably Difficult Combinatorial Games
description: scientific article; zbMATH DE number 3777294