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]
@inproceedings{SK22-1,
title = {Almost Polynomial Factor Inapproximability for Parameterized k-Clique},
author = {Karthik C. S. and Subhash Khot},
year = {2022},
doi = {10.4230/LIPIcs.CCC.2022.6},
url = {https://doi.org/10.4230/LIPIcs.CCC.2022.6},
researchr = {https://researchr.org/publication/SK22-1},
cites = {0},
citedby = {0},
booktitle = {37th Computational Complexity Conference, CCC 2022, July 20-23, 2022, Philadelphia, PA, USA},
editor = {Shachar Lovett},
volume = {234},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn = {978-3-95977-241-9},
}