On the Space Complexity of Parameterized Problems

DOI10.1007/978-3-642-33293-7_20zbMath1374.68240OpenAlexW43934320MaRDI QIDQ4899254

Michael Elberfeld, Till Tantau, Christoph Stockhusen

Publication date: 7 January 2013

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

Full work available at URL: https://doi.org/10.1007/978-3-642-33293-7_20

zbMATH Keywords

feedback vertex setlogarithmic spacereachability problemsparameterized complexity theoryfixed-parameter tractable problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (2)

On the parameterized complexity of non-monotonic logics ⋮ On the space and circuit complexity of parameterized problems: classes and completeness

This page was built for publication: On the Space Complexity of Parameterized Problems