Statistical Algorithms and a Lower Bound for Detecting Planted Cliques Vitaly Feldman Almaden Research Center IBM San Jose, CA 95120 - Dominating set - Document - PDFSEARCH.IO

First Page	Meta Content
	Statistical Algorithms and a Lower Bound for Detecting Planted Cliques Vitaly Feldman Almaden Research Center IBM San Jose, CA 95120 Add to Reading List Document Date: 2013-03-20 23:48:10 Open Document File Size: 336,11 KB Share Result on Facebook

Statistical Algorithms and a Lower Bound for Detecting Planted Cliques Vitaly Feldman Almaden Research Center IBM San Jose, CA 95120Add to Reading List