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

• Type: Conference
• Year: 2007
• Where: CSL
• Authors: Yijia Chen, Jörg Flum
• Keywords: CSL 2007, Miniaturization Mapping, Parameterized Complexity, Subexponential Parameterized Complexity