On the Integrality Gap of Degree-4 Sum of Squares for Planted Clique

ACM Trans. Algorithms, Volume 14, Issue 3, 2018, Pages 28:1-28:31.

Cited by: 31|Views58


The problem of finding large cliques in random graphs and its “planted” variant, where one wants to recover a clique of size ω > log (n) added to an Erdős-Rényi graph G ∼ G(n,1/2), have been intensely studied. Nevertheless, existing polynomial time algorithms can only recover planted cliques of size ω = Ω (√ n). By contrast, information t...More



Get fulltext within 24h
Upload PDF

1.Your uploaded documents will be check within 24h, and coins will be credited to your account.

2.As the current system does not support cash withdrawal, you can add staff WeChat (AMxiaomai) to receive it as a red packet.

3.10 coins will be exchanged for 1 yuan.


Upload a single paper

for 5 coins

Wechat's Red Packet

Upload 50 articles

for 250 coins

Wechat's Red Packet

Upload 200 articles

for 1000 coins

Wechat's Red Packet

Upload 500 articles

for 2500 coins

Wechat's Red Packet

Upload 1000 articles

for 5000 coins

Wechat's Red Packet
Your rating :