Statistical algorithms and a lower bound for detecting planted cliques.

Vitaly Feldman, Elena Grigorescu, Lev Reyzin, Santosh S. Vempala, Ying Xiao

Browse the full STOC paper archive.