A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
On the Space Complexity of Parameterized Problems
[chapter]
2012
Lecture Notes in Computer Science
Parameterized complexity theory measures the complexity of computational problems predominantly in terms of their parameterized time complexity. The purpose of the present paper is to demonstrate that the study of parameterized space complexity can give new insights into the complexity of well-studied parameterized problems like the feedback vertex set problem. We show that the undirected and the directed feedback vertex set problems have different parameterized space complexities, unless L =
doi:10.1007/978-3-642-33293-7_20
fatcat:veuk2fqydjdudhcvepjcf6ak5y