Statistical algorithms and a lower bound for detecting planted cliques.
Vitaly FeldmanElena GrigorescuLev ReyzinSantosh S. VempalaYing XiaoPublished in: STOC (2013)
Keyphrases
- lower bound
- worst case
- optimization problems
- computational cost
- upper and lower bounds
- combinatorial optimization
- benchmark datasets
- theoretical analysis
- computational complexity
- data structure
- learning algorithm
- upper bound
- objective function
- lower and upper bounds
- data sets
- np hard
- evolutionary algorithm
- statistical analysis
- computationally efficient
- graph theory