A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem.
Boaz BarakSamuel B. HopkinsJonathan A. KelnerPravesh KothariAnkur MoitraAaron PotechinPublished in: FOCS (2016)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- worst case
- lower and upper bounds
- np hard
- objective function
- maximum clique
- optimal solution
- linear programming relaxation
- upper and lower bounds
- lower bounding
- maximum weight
- social networks
- independent set
- computational complexity
- sample complexity
- constant factor