The Complexity of Tiling Problems
François Schwarzentruber · arXiv (Cornell University) · 2019
In this document, we collected the most important complexity results of tilings. We also propose a definition of a so-called deterministic set of tile types, in order to capture deterministic classes without the notion of games. We also pinpoint tiling problems complete for respectively LOGSPACE and NLOGSPACE.