Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Vitaly Feldman, Elena Grigorescu, Lev Reyzin, Santosh Vempala, Ying Xiao. Statistical Algorithms and a Lower Bound for Planted Clique. Electronic Colloquium on Computational Complexity (ECCC), 19:64, 2012. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Statistical algorithms and a lower bound for detecting planted cliquesVitaly Feldman, Elena Grigorescu, Lev Reyzin, Santosh Vempala, Ying Xiao. stoc 2013: 655-664 [doi] Statistical Algorithms and a Lower Bound for Detecting Planted CliquesVitaly Feldman, Elena Grigorescu, Lev Reyzin, Santosh Srinivas Vempala, Ying Xiao. JACM, 64(2), 2017. [doi]
The following publications are possibly variants of this publication: