Karthik C. S., Subhash Khot. Almost Polynomial Factor Inapproximability for Parameterized k-Clique. In Shachar Lovett, editor, 37th Computational Complexity Conference, CCC 2022, July 20-23, 2022, Philadelphia, PA, USA. Volume 234 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. [doi]
No references recorded for this publication.
No citations of this publication recorded.