Completeness Results for Parameterized Space Classes

DOI10.1007/978-3-319-03898-8_28zbMath1309.68101arXiv1308.2892OpenAlexW1585305311MaRDI QIDQ2867094

Till Tantau, Christoph Stockhusen

Publication date: 10 December 2013

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1308.2892

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (3)

Parameterised counting in logspace ⋮ Nominal Automata with Name Binding ⋮ On the space and circuit complexity of parameterized problems: classes and completeness

This page was built for publication: Completeness Results for Parameterized Space Classes