On the space complexity of parameterized problems

  • Authors:

  • Michael Elberfeld;Christoph Stockhusen;Till Tantau

  • Affiliations:

  • Institute for Theoretical Computer Science, Universität zu Lübeck, Lübeck, Germany;Institute for Theoretical Computer Science, Universität zu Lübeck, Lübeck, Germany;Institute for Theoretical Computer Science, Universität zu Lübeck, Lübeck, Germany

  • Venue:
  • IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 = NL; which explains why the two problem variants seem to necessitate different algorithmic approaches even though their parameterized time complexity is the same. For a number of further natural parameterized problems, including the longest common subsequence problem and the acceptance problem for multi-head automata, we show that they lie in or are complete for different parameterized space classes; which explains why previous attempts at proving completeness of these problems for parameterized time classes have failed.