Game Values and Computational Complexity: An Analysis via Black-White Combinatorial Games

DOI10.1007/978-3-662-48971-0_58zbMath1472.68067OpenAlexW2395382281MaRDI QIDQ3459906

Luke Schaeffer, Daniel Grier, Jochen Messner, Stephen A. Fenner, Thomas Thierauf

Publication date: 11 January 2016

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48971-0_58

zbMATH Keywords

computational complexitycombinatorial gamesposet gamesblack-white gamesColGraph Nimnumeric games

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial games (91A46)

Related Items (1)

\textsf{PSPACE}-complete two-color planar placement games

This page was built for publication: Game Values and Computational Complexity: An Analysis via Black-White Combinatorial Games