An Isomorphism between Subexponential and Parameterized Complexity Theory

We establish a close connection between (sub)exponential time complexity and parameterized complexity by proving that the so-called miniaturization mapping is a reduction preserving isomorphism between the two theories.

• Type: Conference
• Year: 2006
• Where: COCO
• Authors: Yijia Chen, Martin Grohe
• Keywords: Algorithms, COCO 2006, Reduction Preserving Isomorphism, So-called Miniaturization Mapping, Sub)exponential Time Complexity