Login / Signup
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
Published in:
CoRR (2016)
Keyphrases
</>
lower bound
upper bound
branch and bound algorithm
branch and bound
worst case
objective function
maximum clique
np hard
optimal solution
lower and upper bounds
upper and lower bounds
lower bounding
vc dimension
independent set
image segmentation
sample complexity
average case
data structure
competitive ratio