PSPACE-Completeness of Bloxorz and of Games with 2-Buttons
From MaRDI portal
Publication:2947039
DOI10.1007/978-3-319-18173-8_30zbMath1459.68080arXiv1411.5951WikidataQ59567446 ScholiaQ59567446MaRDI QIDQ2947039
Hans L. Bodlaender, Tom C. van der Zanden
Publication date: 21 September 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.5951
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
91A46: Combinatorial games
