Tight Lower Bounds for Planted Clique in the Degree-4 SOS Program.
Prasad RaghavendraTselil SchrammPublished in: CoRR (2015)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- lower and upper bounds
- objective function
- optimal solution
- lower bounding
- worst case
- upper and lower bounds
- np hard
- quadratic assignment problem
- vc dimension
- maximum clique
- data sets
- randomly generated problems
- regret bounds
- program execution
- sample complexity