The exponential time hypothesis and the parameterized clique problem

  • Authors:

  • Yijia Chen;Kord Eickmeyer;Jörg Flum

  • Affiliations:

  • Department of Computer Science, Shanghai Jiaotong University, China;National Institute of Informatics, Tokyo, Japan;Mathematisches Institut, Albert-Ludwigs-Universität Freiburg, Germany

  • Venue:
  • IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

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.