Boaz Barak, Samuel B. Hopkins, Jonathan A. Kelner, Pravesh Kothari, Ankur Moitra, Aaron Potechin. A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem. Electronic Colloquium on Computational Complexity (ECCC), 23:58, 2016. [doi]
@article{BarakHKKMP16,
title = {A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem},
author = {Boaz Barak and Samuel B. Hopkins and Jonathan A. Kelner and Pravesh Kothari and Ankur Moitra and Aaron Potechin},
year = {2016},
url = {http://eccc.hpi-web.de/report/2016/058},
researchr = {https://researchr.org/publication/BarakHKKMP16},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {23},
pages = {58},
}