scientific article; zbMATH DE number 16390

zbMATH Open0753.90096MaRDI QIDQ3973044FDOQ3973044

Aviezri S. Fraenkel

Publication date: 26 June 1992

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

computational complexityTuring machineAnnihilation GamesGames with DrawsGeneralized Sprague-Grundy FunctionsNim-Like Gamessurvey of combinatorial games

Mathematics Subject Classification ID

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)

Cited In (14)

• The complexity of pursuit on a graph
• Topological games at Princeton, a mathematical memoir
• The complexity of speedrunning video games
• Recent results and questions in combinatorial game complexities
• Automata, Languages and Programming
• Domino Games and Complexity
• The complexity of short two-person games
• Games, puzzles, and computation
• Playing games with algorithms: algorithmic combinatorial game theory
• Title not available (Why is that?)
• Complexity of question/answer games
• The computational complexity of Angry Birds
• A note about games-composition dimension
• Games with winning conditions of high Borel complexity

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)