{"id":"https://openalex.org/W2065563937","doi":"https://doi.org/10.1145/2488608.2488692","title":"Statistical algorithms and a lower bound for detecting planted cliques","display_name":"Statistical algorithms and a lower bound for detecting planted cliques","publication_year":2013,"publication_date":"2013-05-28","ids":{"openalex":"https://openalex.org/W2065563937","doi":"https://doi.org/10.1145/2488608.2488692","mag":"2065563937"},"language":"en","primary_location":{"id":"doi:10.1145/2488608.2488692","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2488608.2488692","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-fifth annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054675941","display_name":"Vitaly Feldman","orcid":"https://orcid.org/0000-0002-3904-759X"},"institutions":[{"id":"https://openalex.org/I4210085935","display_name":"IBM Research - Almaden","ror":"https://ror.org/005w8dd04","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210085935","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Vitaly Feldman","raw_affiliation_strings":["Almaden Research Center, IBM, San Jose, CA, USA"],"affiliations":[{"raw_affiliation_string":"Almaden Research Center, IBM, San Jose, CA, USA","institution_ids":["https://openalex.org/I4210085935"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090091569","display_name":"Elena Grigorescu","orcid":"https://orcid.org/0000-0001-9673-4313"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Elena Grigorescu","raw_affiliation_strings":["Purdue University, West Lafayette, IN, USA"],"affiliations":[{"raw_affiliation_string":"Purdue University, West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081065957","display_name":"Lev Reyzin","orcid":"https://orcid.org/0000-0001-7443-6024"},"institutions":[{"id":"https://openalex.org/I39422238","display_name":"University of Illinois Chicago","ror":"https://ror.org/02mpq6x41","country_code":"US","type":"education","lineage":["https://openalex.org/I39422238"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lev Reyzin","raw_affiliation_strings":["University of Illinois at Chicago, Chicago, IL, USA"],"affiliations":[{"raw_affiliation_string":"University of Illinois at Chicago, Chicago, IL, USA","institution_ids":["https://openalex.org/I39422238"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101983359","display_name":"Santosh Vempala","orcid":"https://orcid.org/0000-0002-3779-433X"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Santosh Vempala","raw_affiliation_strings":["Georgia Institute of Technology, Atlanta, GA, USA","Georgia Institute of Technology Atlanta, GA, USA"],"affiliations":[{"raw_affiliation_string":"Georgia Institute of Technology, Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]},{"raw_affiliation_string":"Georgia Institute of Technology Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100356357","display_name":"Ying Xiao","orcid":"https://orcid.org/0000-0002-6855-0207"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ying Xiao","raw_affiliation_strings":["Georgia Institute of Technology, Atlanta, GA, USA","Georgia Institute of Technology Atlanta, GA, USA"],"affiliations":[{"raw_affiliation_string":"Georgia Institute of Technology, Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]},{"raw_affiliation_string":"Georgia Institute of Technology Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5054675941"],"corresponding_institution_ids":["https://openalex.org/I4210085935"],"apc_list":null,"apc_paid":null,"fwci":20.7579,"has_fulltext":false,"cited_by_count":84,"citation_normalized_percentile":{"value":0.99365545,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"655","last_page":"664"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9945999979972839,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.5876551866531372},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5751399397850037},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.5421536564826965},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.508356511592865},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49976015090942383},{"id":"https://openalex.org/keywords/statistical-model","display_name":"Statistical model","score":0.4794520437717438},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45622947812080383},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.4502677917480469},{"id":"https://openalex.org/keywords/probability-distribution","display_name":"Probability distribution","score":0.4238937199115753},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3428153991699219},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.21144893765449524},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.14488917589187622}],"concepts":[{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.5876551866531372},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5751399397850037},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.5421536564826965},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.508356511592865},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49976015090942383},{"id":"https://openalex.org/C114289077","wikidata":"https://www.wikidata.org/wiki/Q3284399","display_name":"Statistical model","level":2,"score":0.4794520437717438},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45622947812080383},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.4502677917480469},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.4238937199115753},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3428153991699219},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.21144893765449524},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.14488917589187622},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/2488608.2488692","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2488608.2488692","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-fifth annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.251.2502","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.251.2502","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.almaden.ibm.com/cs/people/vitaly/papers/FGRVX_StatComplexity1211.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.297.3139","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.3139","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.levreyzin.com/papers/FeldmanGRVX13.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.761.1934","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.761.1934","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1201.1214.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320324887","display_name":"Shandong Academy of Sciences","ror":"https://ror.org/04y8d6y55"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":73,"referenced_works":["https://openalex.org/W13488910","https://openalex.org/W58673994","https://openalex.org/W134727942","https://openalex.org/W1497517366","https://openalex.org/W1546318054","https://openalex.org/W1548168548","https://openalex.org/W1550811836","https://openalex.org/W1571257748","https://openalex.org/W1575824241","https://openalex.org/W1605711022","https://openalex.org/W1874066214","https://openalex.org/W1971718861","https://openalex.org/W1972894929","https://openalex.org/W1972913305","https://openalex.org/W1980379651","https://openalex.org/W1986010539","https://openalex.org/W1995897489","https://openalex.org/W1999032440","https://openalex.org/W2006412101","https://openalex.org/W2010523825","https://openalex.org/W2010601719","https://openalex.org/W2017127020","https://openalex.org/W2019363670","https://openalex.org/W2023146810","https://openalex.org/W2024060531","https://openalex.org/W2029538739","https://openalex.org/W2030365814","https://openalex.org/W2031648200","https://openalex.org/W2042038477","https://openalex.org/W2049633694","https://openalex.org/W2056760934","https://openalex.org/W2062307640","https://openalex.org/W2064032144","https://openalex.org/W2064680241","https://openalex.org/W2065563937","https://openalex.org/W2069488552","https://openalex.org/W2069730673","https://openalex.org/W2072802070","https://openalex.org/W2078758709","https://openalex.org/W2083875149","https://openalex.org/W2109722477","https://openalex.org/W2116568489","https://openalex.org/W2116616571","https://openalex.org/W2130608487","https://openalex.org/W2133361319","https://openalex.org/W2136023669","https://openalex.org/W2138309709","https://openalex.org/W2143362693","https://openalex.org/W2143724791","https://openalex.org/W2152977846","https://openalex.org/W2154061444","https://openalex.org/W2168315304","https://openalex.org/W2245160765","https://openalex.org/W2406918565","https://openalex.org/W2546502841","https://openalex.org/W2570866188","https://openalex.org/W2579923771","https://openalex.org/W2600681475","https://openalex.org/W2952763838","https://openalex.org/W2962704928","https://openalex.org/W2964145111","https://openalex.org/W3022584652","https://openalex.org/W3104095169","https://openalex.org/W3122057941","https://openalex.org/W3139080059","https://openalex.org/W3184572569","https://openalex.org/W4230257222","https://openalex.org/W4238284510","https://openalex.org/W4238893454","https://openalex.org/W4243843732","https://openalex.org/W6634298207","https://openalex.org/W6676367512","https://openalex.org/W6735749586"],"related_works":["https://openalex.org/W2371352078","https://openalex.org/W2953461625","https://openalex.org/W2077383796","https://openalex.org/W2080136900","https://openalex.org/W2999799752","https://openalex.org/W2372768926","https://openalex.org/W2115167491","https://openalex.org/W2567825307","https://openalex.org/W2054458431","https://openalex.org/W1584510240"],"abstract_inverted_index":{"We":[0],"introduce":[1],"a":[2,15,44,108],"framework":[3,90],"for":[4,75,120,138,157,161],"proving":[5],"lower":[6,111,165],"bounds":[7,166],"on":[8,14,43,113],"computational":[9],"problems":[10,147,159],"over":[11],"distributions,":[12],"based":[13],"class":[16],"of":[17,36,39,60,116,145,170],"algorithms":[18,59,84],"called":[19],"statistical":[20,83,87,97,118],"algorithms.":[21],"For":[22],"such":[23],"algorithms,":[24],"access":[25],"to":[26,32,151,154],"the":[27,37,49,96,114,132],"input":[28,50],"distribution":[29],"is":[30,91,107],"limited":[31],"obtaining":[33],"an":[34],"estimate":[35],"expectation":[38],"any":[40,117,139],"given":[41],"function":[42],"sample":[45],"drawn":[46],"randomly":[47],"from":[48],"distribution,":[51],"rather":[52],"than":[53],"directly":[54],"accessing":[55],"samples.":[56],"Most":[57],"natural":[58],"interest":[61],"in":[62,65,100],"theory":[63,102],"and":[64,79,94,160],"practice,":[66],"e.g.,":[67],"moments-based":[68],"methods,":[69],"local":[70],"search,":[71],"standard":[72],"iterative":[73],"methods":[74],"convex":[76],"optimization,":[77],"MCMC":[78],"simulated":[80],"annealing,":[81],"are":[82],"or":[85],"have":[86,148],"counterparts.":[88],"Our":[89,104,164],"inspired":[92],"by":[93],"generalize":[95],"query":[98],"model":[99],"learning":[101],"[34].":[103],"main":[105],"application":[106],"nearly":[109],"optimal":[110],"bound":[112],"complexity":[115],"algorithm":[119],"detecting":[121],"planted":[122,127,133],"bipartite":[123],"clique":[124,134],"distributions":[125],"(or":[126],"dense":[128],"subgraph":[129],"distributions)":[130],"when":[131],"has":[135],"size":[136],"O(n1/2-\u03b4)":[137],"constant":[140],"\u03b4":[141],">":[142],"0.":[143],"Variants":[144],"these":[146,174],"been":[149],"assumed":[150],"be":[152],"hard":[153],"prove":[155],"hardness":[156],"other":[158],"cryptographic":[162],"applications.":[163],"provide":[167],"concrete":[168],"evidence":[169],"hardness,":[171],"thus":[172],"supporting":[173],"assumptions.":[175]},"counts_by_year":[{"year":2023,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":14},{"year":2014,"cited_by_count":15},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}