Parameterized complexity and subexponential-time computability
The Multivariate Algorithmic Revolution and Beyond
Hi-index | 0.00 |
Recently it has been shown that the miniaturization mapping ℳ faithfully translates bexponential parameterized complexity into (unbounded) parameterized complexity. We determine the pre-images under ℳ 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.