Subexponential time and fixed-parameter tractability: exploiting the miniaturization mapping

Authors:
Yijia Chen;Jörg Flum
Affiliations:
Shanghai Jiaotong University, China;Albert-Ludwigs-Universität Freiburg, Germany
Venue:
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Year:
2007

Citing 5
Cited 1

Tight Lower Bounds for Certain Parameterized NP-Hard Problems

CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
An Isomorphism between Subexponential and Parameterized Complexity Theory

CCC '06 Proceedings of the 21st Annual IEEE Conference on Computational Complexity
Tree acceptors and some of their applications

Journal of Computer and System Sciences
Bounded fixed-parameter tractability and log2n nondeterministic bits

Journal of Computer and System Sciences

Lower Bounds for Kernelizations and Other Preprocessing Procedures

CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently a mapping M, the so-called miniaturization mapping, has been introduced and it has been shown that M faithfully translates subexponential parameterized complexity into (unbounded) parameterized complexity [2]. We determine the preimages under M of various (classes of) problems and show that they coincide with natural reparameterizations which take into account the amount of nondeterminism needed to solve them.