scientific article; zbMATH DE number 16390
From MaRDI portal
Publication:3973044
computational complexityTuring machineAnnihilation GamesGames with DrawsGeneralized Sprague-Grundy FunctionsNim-Like Gamessurvey of combinatorial games
Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) 2-person games (91A05) Games involving graphs (91A43) Combinatorial games (91A46) Complexity of computation (including implicit computational complexity) (03D15) Turing machines and related notions (03D10)
Recommendations
- Recent results and questions in combinatorial game complexities
- scientific article; zbMATH DE number 1834637
- Playing games with algorithms: algorithmic combinatorial game theory
- scientific article; zbMATH DE number 7075886
- Games of no chance 3. Papers from the workshop on combinatorial game theory, Banff, Canada, June 2005
Cited in
(14)- The complexity of speedrunning video games
- Recent results and questions in combinatorial game complexities
- Games, puzzles, and computation
- scientific article; zbMATH DE number 1834637 (Why is no real title available?)
- Topological games at Princeton, a mathematical memoir
- The computational complexity of Angry Birds
- Playing games with algorithms: algorithmic combinatorial game theory
- Domino Games and Complexity
- Games with winning conditions of high Borel complexity
- The complexity of short two-person games
- Complexity of question/answer games
- Automata, Languages and Programming
- The complexity of pursuit on a graph
- A note about games-composition dimension
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3973044)
