The Complexity of Tiling Problems

Download PDF
Open Webpage

François Schwarzentruber

Published: 2019, Last Modified: 13 Oct 2024CoRR 2019EveryoneRevisionsBibTeXCC BY-SA 4.0
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.