Threes!, Fives, 1024!, and 2048 are hard
From MaRDI portal
Publication:1623263
DOI10.1016/j.tcs.2018.03.018zbMath1402.68101arXiv1505.04274OpenAlexW2790674930MaRDI QIDQ1623263
Publication date: 23 November 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1505.04274
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial games (91A46)
Cites Work