%0 Journal Article %1 journals/jacm/FeldmanGRVX17 %A Feldman, Vitaly %A Grigorescu, Elena %A Reyzin, Lev %A Vempala, Santosh S. %A Xiao, Ying %D 2017 %J J. ACM %K dblp %N 2 %P 8:1-8:37 %T Statistical Algorithms and a Lower Bound for Detecting Planted Cliques. %U http://dblp.uni-trier.de/db/journals/jacm/jacm64.html#FeldmanGRVX17 %V 64

@article{journals/jacm/FeldmanGRVX17, added-at = {2019-10-24T00:00:00.000+0200}, author = {Feldman, Vitaly and Grigorescu, Elena and Reyzin, Lev and Vempala, Santosh S. and Xiao, Ying}, biburl = {https://www.bibsonomy.org/bibtex/2e17291699402502c36e67ced72db42f1/dblp}, ee = {https://doi.org/10.1145/3046674}, interhash = {0ca788fd9c65d4219b105b8279c0abfe}, intrahash = {e17291699402502c36e67ced72db42f1}, journal = {J. ACM}, keywords = {dblp}, number = 2, pages = {8:1-8:37}, timestamp = {2019-10-25T11:39:00.000+0200}, title = {Statistical Algorithms and a Lower Bound for Detecting Planted Cliques.}, url = {http://dblp.uni-trier.de/db/journals/jacm/jacm64.html#FeldmanGRVX17}, volume = 64, year = 2017 }