Tatamibari is NP-complete
From MaRDI portal
Publication:6487564
DOI10.4230/lipics.fun.2021.1zbMath1515.68147MaRDI QIDQ6487564
Martin L. Demaine, Aviv Adler, Quanquan C. Liu, Jayson Lynch, Jeffrey Bosboom, Erik D. Demaine
Publication date: 7 February 2023
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial games (91A46)
This page was built for publication: Tatamibari is NP-complete