An Isomorphism Between Subexponential and Parameterized Complexity Theory

Authors:
Yijia Chen;Martin Grohe
Affiliations:
-;-
Venue:
SIAM Journal on Computing
Year:
2007

Citing 0
Cited 3

Improving exhaustive search implies superpolynomial lower bounds

Proceedings of the forty-second ACM symposium on Theory of computing
A basic parameterized complexity primer

The Multivariate Algorithmic Revolution and Beyond
Parameterized complexity and subexponential-time computability

The Multivariate Algorithmic Revolution and Beyond

Quantified Score

Hi-index	0.00

Visualization

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.