An isomorphism between subexponential and parameterized complexity theory

Abstract

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