@InProceedings{manurangsi_et_al:LIPIcs.ITCS.2021.10,
author = {Manurangsi, Pasin and Rubinstein, Aviad and Schramm, Tselil},
title = {{The Strongish Planted Clique Hypothesis and Its Consequences}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {10:1--10:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.10},
URN = {urn:nbn:de:0030-drops-135491},
doi = {10.4230/LIPIcs.ITCS.2021.10},
annote = {Keywords: Planted Clique, Densest k-Subgraph, Hardness of Approximation}
}