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:
Electron. Colloquium Comput. Complex. (2016)
Keyphrases
</>
lower bound
upper bound
branch and bound algorithm
branch and bound
worst case
np hard
maximum clique
objective function
lower and upper bounds
lower bounding
search algorithm
optimal solution
upper and lower bounds
lagrangian relaxation
maximum weight
competitive ratio
bayesian networks
machine learning