The Exponential Time Hypothesis and the Parameterized Clique Problem
In parameterized complexity there are three natural definitions of fixed-parameter tractability called strongly uniform, weakly uniform and nonuniform fpt. Similarly, there are three notions of subexponential time, yielding three flavours of the exponential time hypothesis (ETH) stating that 3Sat is not solvable in subexponential time. It is known that ETH implies that p-Clique is not fixed-parameter tractable if both are taken to be strongly uniform or both are taken to be uniform, and we extend this to the nonuniform case. We also show that even the containment of weakly uniform subexponential time in nonuniform subexponential time is strict. Furthermore, we deduce from nonuniform ETH that no single exponent d allows for arbitrarily good fpt-approximations of clique.
Unable to display preview. Download preview PDF.
- 1.Downey, R., Fellows, M.: Fixed-parameter tractability and completeness iii: some structural aspects of the w hierarchy. In: Ambos-Spies, K., Homer, S., Schöning, U. (eds.) Complexity Theory, New York, NY, USA, pp. 191–225. Cambridge University Press (1993)Google Scholar
- 2.Ganian, R., Hlinený, P., Langer, A., Obdrzálek, J., Rossmanith, P., Sikdar, S.: Lower bounds on the complexity of MSO1 model-checking. In: Proc. STACS 2012, pp. 326–337 (2012)Google Scholar
- 4.Chen, J., Huang, X., Kanj, I.A., Xia, G.: Linear fpt reductions and computational lower bounds. In: Proc. of STOC 2004, pp. 212–221 (2004)Google Scholar
- 6.Grohe, M.: The complexity of homomorphism and constraint satisfaction problems seen from the other side. J. ACM 54(1) (2007)Google Scholar
- 11.Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)Google Scholar