Computational Hardness of Multidimensional Subtraction Games
英文摘要：
We study algorithmic complexity of solving subtraction games in a~fixed dimension with a finite difference set. We prove that there exists a game in this class such that any algorithm solving the game runs in exponential time. Also we prove an existence of a game in this class such that solving the game is PSPACE-hard. The results are based on the construction introduced by Larsson and Wästlund. It relates subtraction games and cellular automata.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
