Playing disjunctive sums is polynomial space complete

DOI10.1007/BF01755964zbMath0474.90100MaRDI QIDQ1159098

F. L. Morris

Publication date: 1981

Published in: International Journal of Game Theory (Search for Journal in Brave)

zbMATH Keywords

polynomial space completeGodisjunctive sum of games

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Positional games (pursuit and evasion, etc.) (91A24)

Related Items

Complexity, appeal and challenges of combinatorial games, Single-suit two-person card play, Geography, Computer Go, Recent results and questions in combinatorial game complexities, Prohibiting repetitions makes playing games substantially harder, Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete.

Cites Work

• GO Is Polynomial-Space Hard
• A Combinatorial Problem Which Is Complete in Polynomial Space
• Unnamed Item
• Unnamed Item
• Unnamed Item