Sciweavers

CSL
2007
Springer

Subexponential Time and Fixed-Parameter Tractability: Exploiting the Miniaturization Mapping

14 years 5 months ago
Subexponential Time and Fixed-Parameter Tractability: Exploiting the Miniaturization Mapping
Recently it has been shown that the miniaturization mapping M faithfully translates subexponential parameterized complexity into (unbounded) parameterized complexity. We determine the preimages under M of various (classes of) problems. For many parameterized problems whose underlying classical problem is in NP we show that the preimages coincide with natural reparameterizations which take into account the amount of nondeterminism needed to solve them. Keywords. Parameterized complexity, exponential time complexity, miniaturization mapping
Yijia Chen, Jörg Flum
Added 07 Jun 2010
Updated 07 Jun 2010
Type Conference
Year 2007
Where CSL
Authors Yijia Chen, Jörg Flum
Comments (0)