Almost Polynomial Factor Inapproximability for Parameterized k-Clique

Karthik C. S., Subhash Khot

The k-Clique problem is a canonical hard problem in parameterized complexity. In this paper, we study the parameterized complexity of approximating the k-Clique problem where an in…