scientific article
From MaRDI portal
Publication:3390714
zbMath1492.91064MaRDI QIDQ3390714
Matthew Ferland, Kyle Burke, Shang-Hua Teng
Publication date: 25 March 2022
Full work available at URL: http://math.colgate.edu/~integers/vb3/vb3.pdf
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial games (91A46) Quantum coherence, entanglement, quantum correlations (81P40) Quantum games (91A81)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Impartial coloring games
- Hex ist Pspace-vollständig. (Hex is Pspace-complete)
- Computing a perfect strategy for nxn chess requires time exponential in n
- Undirected edge geography
- On the complexity of some two-person perfect-information games
- A Nim game played on graphs.
- A graph-theoretical basis of stochastic-cascading network influence: characterizations of influence-based centrality
- Atropos: A PSPACE-Complete Sperner Triangle Game
- GO Is Polynomial-Space Hard
- The Game of Hex and the Brouwer Fixed-Point Theorem
- A Curious Nim-Type Game
- A Combinatorial Problem Which Is Complete in Polynomial Space
This page was built for publication:
