{"id":"https://openalex.org/W2263882035","doi":"https://doi.org/10.1145/2728167","title":"Finding Correlations in Subquadratic Time, with Applications to Learning Parities and the Closest Pair Problem","display_name":"Finding Correlations in Subquadratic Time, with Applications to Learning Parities and the Closest Pair Problem","publication_year":2015,"publication_date":"2015-05-06","ids":{"openalex":"https://openalex.org/W2263882035","doi":"https://doi.org/10.1145/2728167","mag":"2263882035"},"language":"en","primary_location":{"id":"doi:10.1145/2728167","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2728167","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-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/A5079503799","display_name":"Gregory Valiant","orcid":"https://orcid.org/0000-0002-2211-1073"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Gregory Valiant","raw_affiliation_strings":["Stanford University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5079503799"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":12.0199,"has_fulltext":false,"cited_by_count":62,"citation_normalized_percentile":{"value":0.98512117,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"62","issue":"2","first_page":"1","last_page":"45"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9995999932289124,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9995999932289124,"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/T12288","display_name":"Optimization and Search Problems","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9972000122070312,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6909223198890686},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6615415811538696},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.5823096632957458},{"id":"https://openalex.org/keywords/exponent","display_name":"Exponent","score":0.5726436376571655},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4961720407009125},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4734848737716675},{"id":"https://openalex.org/keywords/locality-sensitive-hashing","display_name":"Locality-sensitive hashing","score":0.4641011953353882},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4606144428253174},{"id":"https://openalex.org/keywords/hamming-weight","display_name":"Hamming weight","score":0.41756555438041687},{"id":"https://openalex.org/keywords/perfect-hash-function","display_name":"Perfect hash function","score":0.4130627512931824},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.37884142994880676},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3655068874359131},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.30630818009376526},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.2817324101924896},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.14978906512260437},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.10257881879806519},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.10018682479858398}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6909223198890686},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6615415811538696},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.5823096632957458},{"id":"https://openalex.org/C2780388253","wikidata":"https://www.wikidata.org/wiki/Q5421508","display_name":"Exponent","level":2,"score":0.5726436376571655},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4961720407009125},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4734848737716675},{"id":"https://openalex.org/C74270461","wikidata":"https://www.wikidata.org/wiki/Q1625299","display_name":"Locality-sensitive hashing","level":4,"score":0.4641011953353882},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4606144428253174},{"id":"https://openalex.org/C63361517","wikidata":"https://www.wikidata.org/wiki/Q5645805","display_name":"Hamming weight","level":5,"score":0.41756555438041687},{"id":"https://openalex.org/C87431388","wikidata":"https://www.wikidata.org/wiki/Q2070573","display_name":"Perfect hash function","level":4,"score":0.4130627512931824},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.37884142994880676},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3655068874359131},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.30630818009376526},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.2817324101924896},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.14978906512260437},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.10257881879806519},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.10018682479858398},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C7608002","wikidata":"https://www.wikidata.org/wiki/Q477202","display_name":"Cryptographic hash function","level":3,"score":0.0},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2728167","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2728167","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":48,"referenced_works":["https://openalex.org/W1497953515","https://openalex.org/W1529679142","https://openalex.org/W1541459201","https://openalex.org/W1562285034","https://openalex.org/W1760474993","https://openalex.org/W1915272284","https://openalex.org/W1963785789","https://openalex.org/W1968540673","https://openalex.org/W1979848457","https://openalex.org/W1980175560","https://openalex.org/W1990811538","https://openalex.org/W1992282993","https://openalex.org/W1995897489","https://openalex.org/W1997744504","https://openalex.org/W2002058256","https://openalex.org/W2007466965","https://openalex.org/W2012833704","https://openalex.org/W2023683873","https://openalex.org/W2026103826","https://openalex.org/W2038073775","https://openalex.org/W2038276547","https://openalex.org/W2047430378","https://openalex.org/W2050689197","https://openalex.org/W2058785578","https://openalex.org/W2059998776","https://openalex.org/W2061845601","https://openalex.org/W2063003848","https://openalex.org/W2064680241","https://openalex.org/W2065151783","https://openalex.org/W2071572981","https://openalex.org/W2088101210","https://openalex.org/W2089311600","https://openalex.org/W2105818667","https://openalex.org/W2110824700","https://openalex.org/W2111809688","https://openalex.org/W2123485784","https://openalex.org/W2127859122","https://openalex.org/W2145065594","https://openalex.org/W2147717514","https://openalex.org/W2149709658","https://openalex.org/W2151237818","https://openalex.org/W2162006472","https://openalex.org/W2165558283","https://openalex.org/W2397770138","https://openalex.org/W2405760463","https://openalex.org/W2949136552","https://openalex.org/W4231258329","https://openalex.org/W4302042473"],"related_works":["https://openalex.org/W2008960744","https://openalex.org/W2105471374","https://openalex.org/W2963549154","https://openalex.org/W2158117886","https://openalex.org/W1987803429","https://openalex.org/W1582340598","https://openalex.org/W1519122282","https://openalex.org/W2182731056","https://openalex.org/W3013281356","https://openalex.org/W2740543340"],"abstract_inverted_index":{"Given":[0,219,347,439],"a":[1,169,186,330,356,448,468],"set":[2,241,263,377,463],"of":[3,23,81,102,123,131,137,171,181,188,224,264,291,323,332,362,367,378,384,422,454,458,464,470,473,491,521,528],"n":[4,103,159,236,248,269,274,292,300,306,333,351,366,403,409,425,443,457,505,511,522,525],"d":[5,34,160],"-dimensional":[6,161],"Boolean":[7,352,444],"vectors":[8,14,25,172],"with":[9,20,217,228,283,345,355,401,427,447,486,503],"the":[10,13,21,43,79,86,100,118,127,182,225,238,251,262,280,289,296,321,368,376,382,416,423,459,462,471,489,518],"promise":[11],"that":[12,26,167,180,260,328],"are":[15],"chosen":[16],"uniformly":[17,348,440],"at":[18,189,244],"random":[19,349,441],"exception":[22],"two":[24,44],"have":[27,208],"Pearson":[28],"correlation":[29],"coefficient":[30],"\u03c1":[31,95],"(Hamming":[32],"distance":[33,177],"\u00b7":[35],"1-\u03c1/":[36],"2),":[37],"how":[38],"quickly":[39],"can":[40],"one":[41],"find":[42],"correlated":[45],"vectors?":[46],"We":[47],"present":[48],"an":[49,165,222,258,396,428,498],"algorithm":[50,89,140,166,259,282,397,472,481,499],"which,":[51],"for":[52,90,93,145,312,391,398,419,482,500],"any":[53,153],"constant":[54,57,156,430],"\u03f5>0,":[55,157],"and":[56,105,126,135,192,250,311,478],"\u03c1>0,":[58],"runs":[59,193],"in":[60,99,194,267,288],"expected":[61],"time":[62,195,268],"O":[63,70,108,196,210,298,304],"(n":[64,71,109,197,211],"5-\u03c9":[65],"/":[66],"4-\u03c9+\u03f5":[67],"+nd)":[68],"<":[69,76,273,408,432,510],"1.62":[72],"+nd),":[73],"where":[74,231],"\u03c9":[75],"2.4":[77],"is":[78,85,254,279,359,415,451],"exponent":[80,101,290],"matrix":[82],"multiplication.":[83],"This":[84,278],"first":[87,281,417],"subquadratic--time":[88],"this":[91,138,399,420,501],"problem":[92,230,400,421,502],"which":[94,358,414,450,515],"does":[96],"not":[97],"appear":[98],",":[104,237,249,293,514],"improves":[106,319,516],"upon":[107,320],"2-O(\u03c1)":[110],"),":[111],"given":[112,158],"by":[113,185,371],"Paturi":[114],"et":[115,325,386,475,493,530],"al.":[116,326,387,476,494,531],"[1989],":[117],"Locality":[119,205],"Sensitive":[120,206],"Hashing":[121],"approach":[122,130],"Motwani":[124],"[1998]":[125],"Bucketing":[128],"Codes":[129],"Dubiner":[132],"[2008].":[133],"Applications":[134],"extensions":[136],"basic":[139],"yield":[141],"significantly":[142],"improved":[143],"algorithms":[144,203],"several":[146],"other":[147],"problems.":[148],"Approximate":[149],"Closest":[150],"Pair.":[151],"For":[152],"sufficiently":[154],"small":[155],"vectors,":[162,353,445],"there":[163,256],"exists":[164,257],"returns":[168],"pair":[170,184],"whose":[173],"Euclidean":[174],"(or":[175],"Hamming)":[176],"differs":[178],"from":[179,221,295],"closest":[183],"factor":[187],"most":[190,245],"1+\u03f5,":[191],"2-\u0398(\u221a\u03f5":[198],")).":[199],"The":[200],"best":[201,520],"previous":[202,519],"(including":[204],"Hashing)":[207],"runtime":[209,331,402,418,504],"2-O(\u03f5)":[212],").":[213],"Learning":[214,342,434],"Sparse":[215],"Parities":[216],"Noise.":[218,346,438],"samples":[220],"instance":[223],"learning":[226,392,483],"parities":[227,485],"noise":[229,252,314,372,487],"each":[232],"example":[233],"has":[234,242],"length":[235,350,442],"true":[239],"parity":[240],"size":[243],"k":[246,265,271,301,307,343,364,393,405,435,455,508],"\u00ab":[247,365,456],"rate":[253,373],"\u03b7,":[255,374],"identifies":[261],"indices":[266],"\u03c9+\u03f5/3":[270,404],"poly(1/1-2\u03b7)":[272],"0.8k":[275,410],"poly(1/1-2":[276],"\u03b7).":[277],"no":[284],"dependence":[285],"on":[286,517],"\u03b7":[287],"aside":[294],"trivial":[297],"((":[299],"))":[302],"\u2248":[303,524],"(":[305],")":[308],"brute-force":[309],"algorithm,":[310],"large":[313],"rates":[315],"(\u03b7":[316],">":[317],"0.4),":[318],"results":[322],"Grigorescu":[324],"[2011]":[327],"give":[329],"(1+(2":[334],"\u03b7)":[335],"2":[336],"+":[337],"o":[338],"(1))k/2":[339],"poly":[340,406,411],"(1/1-2\u03b7).":[341],"-Juntas":[344,436],"together":[354,446],"label,":[357,449],"some":[360,452],"function":[361,453],"just":[363],"bits,":[369,460],"perturbed":[370],"return":[375,461],"relevant":[379,465],"indices.":[380,466],"Leveraging":[381],"reduction":[383,490],"Feldman":[385,492],"[2009],":[388,495],"our":[389,480],"result":[390],"-parities":[394],"implies":[395],"(1/1-2\u03b7)":[407],"(1/1-2":[412],"\u03b7),":[413],"form":[424],"ck":[426],"absolute":[429],"c":[431],"1.":[433],"without":[437],"Using":[467],"modification":[469],"Mossel":[474,529],"[2004],":[477],"employing":[479],"sparse":[484],"via":[488],"we":[496],"obtain":[497],"\u03c9+":[506],"\u03f5/4":[507],"poly(n)":[509,513,527],"0.6k":[512],"\u03c9+1/\u03c9k":[523],"0.7k":[526],"[2004].":[532]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":11},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":11},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":7}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}