![](/img/cover-not-exists.png)
[ACM Press the 45th annual ACM symposium - Palo Alto, California, USA (2013.06.01-2013.06.04)] Proceedings of the 45th annual ACM symposium on Symposium on theory of computing - STOC '13 - Statistical algorithms and a lower bound for detecting planted cliques
Feldman, Vitaly, Grigorescu, Elena, Reyzin, Lev, Vempala, Santosh, Xiao, YingYear:
2013
Language:
english
DOI:
10.1145/2488608.2488692
File:
PDF, 627 KB
english, 2013