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

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

We prove that with high probability over the choice of a random graph G from the Erds-Rényi distribution G(n,1/2), the n[superscript o(d)]-time degree d Sum-of-Squares semidefinite programming relaxation for the clique problem will give a value of at least n[superscript 1/2-c(d/log n)1/2] for some...

Full description

Bibliographic Details
Main Authors: Barak, Boaz (Author), Hopkins, Samuel B. (Author), Kothari, Pravesh (Author), Potechin, Aaron (Author), Moitra, Ankur (Contributor), Kelner, Jonathan Adam (Contributor)
Other Authors: Massachusetts Institute of Technology. Department of Mathematics (Contributor)
Format: Article
Language:English
Published: Institute of Electrical and Electronics Engineers (IEEE), 2018-06-05T15:05:11Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items