On the Space Complexity of Parameterized Problems
type: Item
instance of: scholarly article
title: On the Space Complexity of Parameterized Problems
zbMATH Open document ID: 1374.68240
DOI: 10.1007/978-3-642-33293-7_20
author: Michael Elberfeld
author: Christoph Stockhusen
author: Till Tantau
published in: Parameterized and Exact Computation
publication date: 2013-01-07T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 6122708
zbMATH Keywords: parameterized complexity theory
zbMATH Keywords: logarithmic space
zbMATH Keywords: fixed-parameter tractable problems
zbMATH Keywords: feedback vertex set
zbMATH Keywords: reachability problems
MaRDI profile type: MaRDI publication profile
full work available at URL: 978-3-642-33293-7 20
OpenAlex ID: W43934320
Recommended article: On the space and circuit complexity of parameterized problems: classes and completeness
Recommended article: Q4393480
Recommended article: On space-efficient algorithms for certain NP-complete problems
Recommended article: On Parameterized Approximability
Recommended article: Parameterized and Exact Computation
Recommended article: Parameterized complexity of constraint satisfaction problems
Recommended article: Fundamentals of parameterized complexity
Recommended article: On the structure of parameterized problems in NP
Recommended article: The Parameterized Complexity of Maximality and Minimality Problems
description: scientific article; zbMATH DE number 6122708