Statistical Algorithms and a Lower Bound for Detecting Planted Cliques.
Vitaly FeldmanElena GrigorescuLev ReyzinSantosh S. VempalaYing XiaoPublished in: J. ACM (2017)
Keyphrases
- lower bound
- worst case
- upper bound
- computational complexity
- computational cost
- optimization problems
- computationally efficient
- times faster
- orders of magnitude
- lower and upper bounds
- significant improvement
- benchmark datasets
- graph theory
- statistical measures
- average case
- statistical approaches
- data mining
- branch and bound algorithm
- data structure
- optimal solution
- reinforcement learning
- learning algorithm