Statistical Algorithms and a Lower Bound for Planted Clique.Vitaly Feldman,Elena Grigorescu,Lev Reyzin,Santosh Vempala,Ying XiaoElectronic Colloquium on Computational Complexity (ECCC)(2012)引用 212|浏览55暂无评分AI 理解论文溯源树样例生成溯源树,研究论文发展脉络