An Isomorphism Between Subexponential and Parameterized Complexity Theory
Yijia Chen, Martin Grohe · SIAM Journal on Computing · 2007
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.