Recent results and questions in combinatorial game complexities
From MaRDI portal
(Redirected from Publication:1583532)
Recommendations
Cites work
- scientific article; zbMATH DE number 988825 (Why is no real title available?)
- scientific article; zbMATH DE number 3128730 (Why is no real title available?)
- scientific article; zbMATH DE number 3952008 (Why is no real title available?)
- scientific article; zbMATH DE number 3761989 (Why is no real title available?)
- scientific article; zbMATH DE number 16392 (Why is no real title available?)
- scientific article; zbMATH DE number 3521877 (Why is no real title available?)
- scientific article; zbMATH DE number 3520176 (Why is no real title available?)
- scientific article; zbMATH DE number 598464 (Why is no real title available?)
- scientific article; zbMATH DE number 3446720 (Why is no real title available?)
- scientific article; zbMATH DE number 3236819 (Why is no real title available?)
- scientific article; zbMATH DE number 3397597 (Why is no real title available?)
- scientific article; zbMATH DE number 3084373 (Why is no real title available?)
- N by N Checkers is Exptime Complete
- A Combinatorial Problem Which Is Complete in Polynomial Space
- A Curious Nim-Type Game
- A Gamut of Game Theories
- A complete analysis of von Neumann's Hackendot
- A deletion game on hypergraphs
- Algebraic solutions of partizan games with cycles
- All Games Bright and Beautiful
- Classes of Pebble Games and Complete Problems
- Complexity of problems in games, graphs and algebraic equations
- Computing a perfect strategy for nxn chess requires time exponential in n
- Constant bounds on the moments of the height of binary search trees
- Epidemiography. II: Games with a dozing yet winning player
- GO Is Polynomial-Space Hard
- Games of no chance. Combinatorial games at MSRI. Workshop, July 11--21, 1994 in Berkeley, CA, USA
- Gobang is PSPACE-complete
- Graphs and composite games
- Heap games, numeration systems and sequences
- Hex ist Pspace-vollständig. (Hex is Pspace-complete)
- Loopy Games
- Misère annihilation games
- Nim-type games
- Nonhomogeneous spectra of numbers
- On the complexity of some two-person perfect-information games
- PSPACE-Hardness of some combinatorial games
- Playing disjunctive sums is polynomial space complete
- Some combinatorial game problems require Ω( n k ) time
- Strategies for compounds of partizan games
- Strategy for a class of games with dynamic ties
- Sums of Zuchswang games
- Systems of Numeration
- The complexity of pursuit on a graph
- The generalized Sprague-Grundy function and its invariance under certain mappings
- Theory of annihilation games
- Theory of annihilation games. I
Cited in
(8)- scientific article; zbMATH DE number 7075886 (Why is no real title available?)
- Games, complexity classes, and approximation algorithms.
- Comparative Study of Approximate Strategies for Playing Sum Games Based on Subgame Types
- scientific article; zbMATH DE number 5038466 (Why is no real title available?)
- The complexity of poset games
- Expository notes on computability and complexity in (arithmetical) games
- Complexity of circuit intersection in graphs
- scientific article; zbMATH DE number 16390 (Why is no real title available?)
This page was built for publication: Recent results and questions in combinatorial game complexities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583532)
