The Complexity of Tiling Problems

François Schwarzentruber

Home/Archive/arXiv

arXiv · 1907.00102

The Complexity of Tiling Problems

François Schwarzentruber

View original source ↗Read source document ↗Export metadata ↓

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.

Explore related subjects

cs.CC

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

François Schwarzentruber. 2019-08-21. The Complexity of Tiling Problems. https://arxiv.org/abs/1907.00102

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Graph Homomorphisms and Universal Algebra

Constraint satisfaction problems are computational problems that naturally appear in many areas of theoretical computer science. One of the central themes is their computational complexity, and in particular the border between polynomial-time tractability and NP-hardness. In this course we introduce the universal-algebraic approach to study the computational complexity of finite-domain CSPs. The course covers in particular the cyclic terms and bounded width theorems. To keep the presentation accessible, we start the course in the tangible setting of directed graphs and graph homomorphism problems.

cs.CC↗

arXiv2026

The Exact Growth Rate of Space-Optimal Reversible Pebbling on Chains

We determine the exact time exponent of space-optimal reversible pebbling on chains as $1.331742379256310\ldots$. The growth rate of space-optimal reach exists as a limit and admits a variational formula. The same exponent governs complete computations at minimal space, uniformly in the chain length.

cs.CC↗

arXiv2026

Randomized query complexity can beat certificate complexity

A long-standing open question in query complexity asks whether there is a total Boolean function f with R(f) << C(f), where R(f) and C(f) denote its bounded-error randomized query complexity and certificate complexity, respectively. We construct a function with R(f) = O~(sqrt{C(f)}), which is optimal up to log factors. The same function also has $Q(f) = O~(C(f)^{1/4}), where Q(f) is the bounded-error quantum query complexity of f, which is also nearly optimal.

cs.CC↗