Statistical algorithms and a lower bound for detecting planted cliques. (2013)

by Vitaly Feldman, Elena Grigorescu, Lev Reyzin, Santosh Vempala, Ying Xiao
Venue:In Proceedings of the forty-fifth annual ACM symposium on Theory of computing,