The Exponential Time Hypothesis and the Parameterized Clique Problem

  • Yijia Chen
  • Kord Eickmeyer
  • Jörg Flum
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7535)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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
  3. 3.
    Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? Journal of Computer and System Sciences 63, 512–530 (2001)MathSciNetMATHCrossRefGoogle Scholar
  4. 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
  5. 5.
    Flum, J., Grohe, M.: Parametrized complexity and subexponential time (column: Computational complexity). Bulletin of the EATCS 84, 71–100 (2004)MathSciNetMATHGoogle Scholar
  6. 6.
    Grohe, M.: The complexity of homomorphism and constraint satisfaction problems seen from the other side. J. ACM 54(1) (2007)Google Scholar
  7. 7.
    Downey, R.: The Birth and Early Years of Parameterized Complexity. In: Bodlaender, H.L., Downey, R., Fomin, F.V., Marx, D. (eds.) Fellows Festschrift 2012. LNCS, vol. 7370, pp. 17–38. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  8. 8.
    Chen, Y., Flum, J.: On miniaturized problems in parameterized complexity theory. Theoretical Computer Science 351(3), 314–336 (2006)MathSciNetMATHCrossRefGoogle Scholar
  9. 9.
    Chen, Y., Grohe, M., Grüber, M.: On Parameterized Approximability. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 109–120. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  10. 10.
    Marx, D.: Parameterized complexity and approximation algorithms. The Computer Journal 51, 60–78 (2008)CrossRefGoogle Scholar
  11. 11.
    Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Yijia Chen
    • 1
  • Kord Eickmeyer
    • 2
  • Jörg Flum
    • 3
  1. 1.Department of Computer ScienceShanghai Jiaotong UniversityChina
  2. 2.National Institute of InformaticsTokyoJapan
  3. 3.Mathematisches InstitutAlbert-Ludwigs-Universität FreiburgGermany

Personalised recommendations