The Complexity of Tiling Problems
Computational Complexity
2019-08-22 v2
Abstract
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.
Cite
@article{arxiv.1907.00102,
title = {The Complexity of Tiling Problems},
author = {François Schwarzentruber},
journal= {arXiv preprint arXiv:1907.00102},
year = {2019}
}