A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem

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]

Abstract

Abstract is missing.