Skip Navigation


Journal of Logic and Computation Advance Access originally published online on August 3, 2008
Journal of Logic and Computation 2009 19(1):89-122; doi:10.1093/logcom/exn029
This Article
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
19/1/89    most recent
exn029v1
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Chen, Y.
Right arrow Articles by Flum, J.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author, 2008. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

This article appears in the following Journal of Logic and Computation issue: Special Issue: Logic and Computation in the Real World: CiE 2007 [View the issue table of contents]

Original Articles

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

Yijia Chen

BASICS, Department of Computer Science, Shanghai Jiaotong University, Shanghai 200030, China
E-mail: yijia.chen{at}cs.sjtu.edu.cn

Jörg Flum

Abteilung für Mathematische Logik, Universität Freiburg, Eckerstr. 1, 79104 Freiburg, Germany
E-mail: joerg.flum{at}math.uni-freiburg.de

Received 26 September 2007.


  Abstract

Recently it has been shown that the miniaturization mapping M faithfully translates bexponential parameterized complexity into (unbounded) parameterized complexity. We determine the pre-images under M of various (classes of) problems. For many parameterized problems whose underlying classical problem is in NP we show that the pre-images coincide with natural reparameterizations that take into account the amount of non-determinism needed to solve them.

Keywords: Parameterized complexity; exponential time complexity; miniaturization mapping


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.