Nimber-preserving reduction: game secrets and homomorphic Sprague-Grundy theorem
From MaRDI portal
Publication:6562875
DOI10.1016/J.TCS.2024.114636MaRDI QIDQ6562875FDOQ6562875
Authors: Kyle Burke, Matthew Ferland, Shang-Hua Teng 
Publication date: 27 June 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Chomp, Recurrences and Chaos(?)
- Title not available (Why is that?)
- Winning ways for your mathematical plays. Vol. 1.
- The Game of Hex and the Brouwer Fixed-Point Theorem
- Hex ist Pspace-vollständig. (Hex is Pspace-complete)
- On the complexity of some two-person perfect-information games
- GO Is Polynomial-Space Hard
- A Combinatorial Problem Which Is Complete in Polynomial Space
- Title not available (Why is that?)
- Deciding the Winner of an Arbitrary Finite Poset Game Is PSPACE-Complete
- Complexity, appeal and challenges of combinatorial games
- A Nim game played on graphs.
- Title not available (Why is that?)
- Impartial coloring games
- Undirected edge geography
- UNO is hard, even for a single player
- Title not available (Why is that?)
- Computing a perfect strategy for nxn chess requires time exponential in n
- On the complexity of computing winning strategies for finite poset games
- Nim, a game with a complete mathematical theory.
- On the Structure of Mis\`ere Impartial Games
- The role of quantum correlations in cop and robber game
- Title not available (Why is that?)
- Atropos: a PSPACE-complete Sperner triangle game
This page was built for publication: Nimber-preserving reduction: game secrets and homomorphic Sprague-Grundy theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6562875)
