@InProceedings{mardia:LIPIcs.ITCS.2021.34,
author = {Mardia, Jay},
title = {{Is the Space Complexity of Planted Clique Recovery the Same as That of Detection?}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {34:1--34:17},
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.34},
URN = {urn:nbn:de:0030-drops-135734},
doi = {10.4230/LIPIcs.ITCS.2021.34},
annote = {Keywords: Statistical computational gaps, Planted clique, Space complexity, Average case computational complexity}
}