{"id":"https://openalex.org/W2028085501","doi":"https://doi.org/10.1145/2746539.2746625","title":"Sum of Squares Lower Bounds from Pairwise Independence","display_name":"Sum of Squares Lower Bounds from Pairwise Independence","publication_year":2015,"publication_date":"2015-06-03","ids":{"openalex":"https://openalex.org/W2028085501","doi":"https://doi.org/10.1145/2746539.2746625","mag":"2028085501"},"language":"en","primary_location":{"id":"doi:10.1145/2746539.2746625","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2746539.2746625","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-seventh 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/A5102710346","display_name":"Boaz Barak","orcid":"https://orcid.org/0000-0002-4053-8927"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]},{"id":"https://openalex.org/I4400600948","display_name":"Microsoft Research New England (United States)","ror":"https://ror.org/010wkqn50","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4400600948"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Boaz Barak","raw_affiliation_strings":["Microsoft Research New England, Cambridge, MA, USA","Microsoft Research New-England, Cambridge, MA, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research New England, Cambridge, MA, USA","institution_ids":["https://openalex.org/I1290206253","https://openalex.org/I4400600948"]},{"raw_affiliation_string":"Microsoft Research New-England, Cambridge, MA, USA#TAB#","institution_ids":["https://openalex.org/I1290206253","https://openalex.org/I4400600948"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100856892","display_name":"Siu On Chan","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]},{"id":"https://openalex.org/I4400600948","display_name":"Microsoft Research New England (United States)","ror":"https://ror.org/010wkqn50","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4400600948"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Siu On Chan","raw_affiliation_strings":["Microsoft Research New England, Cambridge, MA, USA","Microsoft Research New-England, Cambridge, MA, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research New England, Cambridge, MA, USA","institution_ids":["https://openalex.org/I1290206253","https://openalex.org/I4400600948"]},{"raw_affiliation_string":"Microsoft Research New-England, Cambridge, MA, USA#TAB#","institution_ids":["https://openalex.org/I1290206253","https://openalex.org/I4400600948"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068103506","display_name":"Pravesh K. Kothari","orcid":"https://orcid.org/0000-0002-8689-6770"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pravesh K. Kothari","raw_affiliation_strings":["The University of Texas at Austin, Austin, TX, USA","The University of Texas At Austin, Austin, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Texas at Austin, Austin, TX, USA","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"The University of Texas At Austin, Austin, TX, USA","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.6319,"has_fulltext":false,"cited_by_count":34,"citation_normalized_percentile":{"value":0.97761381,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"97","last_page":"106"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991999864578247,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991999864578247,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9922000169754028,"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/pairwise-independence","display_name":"Pairwise independence","score":0.8529006242752075},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.7304605841636658},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6447283029556274},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.6232671737670898},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6231563091278076},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.6176538467407227},{"id":"https://openalex.org/keywords/independence","display_name":"Independence (probability theory)","score":0.5987395644187927},{"id":"https://openalex.org/keywords/explained-sum-of-squares","display_name":"Explained sum of squares","score":0.5589383244514465},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.538199245929718},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.4960406720638275},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4112665057182312},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3999626934528351},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.29856687784194946},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24615588784217834},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.22722557187080383},{"id":"https://openalex.org/keywords/random-variable","display_name":"Random variable","score":0.20564371347427368},{"id":"https://openalex.org/keywords/sum-of-normally-distributed-random-variables","display_name":"Sum of normally distributed random variables","score":0.07467696070671082},{"id":"https://openalex.org/keywords/independent-and-identically-distributed-random-variables","display_name":"Independent and identically distributed random variables","score":0.07282903790473938}],"concepts":[{"id":"https://openalex.org/C114928208","wikidata":"https://www.wikidata.org/wiki/Q17104952","display_name":"Pairwise independence","level":5,"score":0.8529006242752075},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.7304605841636658},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6447283029556274},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.6232671737670898},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6231563091278076},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.6176538467407227},{"id":"https://openalex.org/C35651441","wikidata":"https://www.wikidata.org/wiki/Q625303","display_name":"Independence (probability theory)","level":2,"score":0.5987395644187927},{"id":"https://openalex.org/C49847556","wikidata":"https://www.wikidata.org/wiki/Q3964631","display_name":"Explained sum of squares","level":2,"score":0.5589383244514465},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.538199245929718},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.4960406720638275},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4112665057182312},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3999626934528351},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.29856687784194946},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24615588784217834},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.22722557187080383},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.20564371347427368},{"id":"https://openalex.org/C182514268","wikidata":"https://www.wikidata.org/wiki/Q7636889","display_name":"Sum of normally distributed random variables","level":4,"score":0.07467696070671082},{"id":"https://openalex.org/C141513077","wikidata":"https://www.wikidata.org/wiki/Q378542","display_name":"Independent and identically distributed random variables","level":3,"score":0.07282903790473938},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2746539.2746625","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2746539.2746625","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-seventh annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1587123489","https://openalex.org/W1964557415","https://openalex.org/W1967344706","https://openalex.org/W1967821609","https://openalex.org/W1981566278","https://openalex.org/W1985123706","https://openalex.org/W2002025272","https://openalex.org/W2012805418","https://openalex.org/W2022749269","https://openalex.org/W2028085501","https://openalex.org/W2028932986","https://openalex.org/W2048564574","https://openalex.org/W2083360043","https://openalex.org/W2083858754","https://openalex.org/W2083896132","https://openalex.org/W2098180694","https://openalex.org/W2107052785","https://openalex.org/W2110871651","https://openalex.org/W2115318789","https://openalex.org/W2120358419","https://openalex.org/W2125534993","https://openalex.org/W2133404041","https://openalex.org/W2146777332","https://openalex.org/W2179897858","https://openalex.org/W2185716868","https://openalex.org/W2187412414","https://openalex.org/W2969292053","https://openalex.org/W3144358832","https://openalex.org/W3145543370","https://openalex.org/W4246010551"],"related_works":["https://openalex.org/W3090381670","https://openalex.org/W2953163485","https://openalex.org/W2493494838","https://openalex.org/W2963700124","https://openalex.org/W2624196447","https://openalex.org/W2077924482","https://openalex.org/W4297923520","https://openalex.org/W2771160919","https://openalex.org/W4301659259","https://openalex.org/W4298028631"],"abstract_inverted_index":{"We":[0],"prove":[1],"that":[2,10,32,57],"for":[3,67],"every":[4],"\u03b5>0":[5],"and":[6],"predicate":[7],"P:{0,1}k->":[8],"{0,1}":[9],"supports":[11],"a":[12,39],"pairwise":[13],"independent":[14],"distribution,":[15],"there":[16],"exists":[17],"an":[18],"instance":[19],"I":[20,58],"of":[21,42,50],"the":[22,46],"Max":[23],"P":[24],"constraint":[25],"satisfaction":[26],"problem":[27],"on":[28],"n":[29],"variables":[30],"such":[31],"no":[33],"assignment":[34],"can":[35],"satisfy":[36],"more":[37],"than":[38],"~(|P-1(1)|)/(2k)+\u03b5":[40],"fraction":[41],"I's":[43],"constraints":[44],"but":[45],"degree":[47],"\u03a9(n)":[48],"Sum":[49],"Squares":[51],"semidefinite":[52],"programming":[53],"hierarchy":[54],"cannot":[55],"certify":[56],"is":[59],"unsatisfiable.":[60],"Similar":[61],"results":[62],"were":[63],"previously":[64],"only":[65],"known":[66],"weaker":[68],"hierarchies.":[69]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":8}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}