{"id":"https://openalex.org/W3034256405","doi":"https://doi.org/10.1145/3357713.3384319","title":"Lifting sum-of-squares lower bounds: degree-2 to degree-4","display_name":"Lifting sum-of-squares lower bounds: degree-2 to degree-4","publication_year":2020,"publication_date":"2020-06-07","ids":{"openalex":"https://openalex.org/W3034256405","doi":"https://doi.org/10.1145/3357713.3384319","mag":"3034256405"},"language":"en","primary_location":{"id":"doi:10.1145/3357713.3384319","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3357713.3384319","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384319","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384319","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5006210579","display_name":"Sidhanth Mohanty","orcid":"https://orcid.org/0000-0001-8794-7616"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sidhanth Mohanty","raw_affiliation_strings":["University of California at Berkeley, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California at Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101701586","display_name":"Prasad Raghavendra","orcid":"https://orcid.org/0009-0009-7851-0653"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Prasad Raghavendra","raw_affiliation_strings":["University of California at Berkeley, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California at Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071289810","display_name":"Jeff Xu","orcid":"https://orcid.org/0009-0004-8327-4126"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jeff Xu","raw_affiliation_strings":["University of California at Berkeley, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California at Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":27,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"840","last_page":"853"},"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.9993000030517578,"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.9993000030517578,"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/T12303","display_name":"Tensor decomposition and applications","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/2605","display_name":"Computational Mathematics"},"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.9968000054359436,"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/degree","display_name":"Degree (music)","score":0.8192357420921326},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6816235184669495},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.5593979358673096},{"id":"https://openalex.org/keywords/explained-sum-of-squares","display_name":"Explained sum of squares","score":0.5446263551712036},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5146964192390442},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.48357242345809937},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.48311448097229004},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4543740451335907},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.42397406697273254},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3846453130245209},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3684789538383484},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.36691024899482727},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.09717446565628052},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08464497327804565}],"concepts":[{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.8192357420921326},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6816235184669495},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.5593979358673096},{"id":"https://openalex.org/C49847556","wikidata":"https://www.wikidata.org/wiki/Q3964631","display_name":"Explained sum of squares","level":2,"score":0.5446263551712036},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5146964192390442},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.48357242345809937},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.48311448097229004},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4543740451335907},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.42397406697273254},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3846453130245209},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3684789538383484},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.36691024899482727},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.09717446565628052},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08464497327804565},{"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/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3357713.3384319","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3357713.3384319","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384319","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3357713.3384319","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3357713.3384319","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384319","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6057211474","display_name":null,"funder_award_id":"CCF-1718695","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8891831872","display_name":"AF:Small:Mathematical Programming for Average-Case Problems","funder_award_id":"1718695","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320310145","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3034256405.pdf","grobid_xml":"https://content.openalex.org/works/W3034256405.grobid-xml"},"referenced_works_count":45,"referenced_works":["https://openalex.org/W58673994","https://openalex.org/W121410702","https://openalex.org/W1518885151","https://openalex.org/W1527520754","https://openalex.org/W1592213313","https://openalex.org/W1650706190","https://openalex.org/W1739872454","https://openalex.org/W1859301526","https://openalex.org/W1967344706","https://openalex.org/W1993418693","https://openalex.org/W2002025272","https://openalex.org/W2012805418","https://openalex.org/W2022749269","https://openalex.org/W2023729725","https://openalex.org/W2049087128","https://openalex.org/W2067348645","https://openalex.org/W2090081488","https://openalex.org/W2095058792","https://openalex.org/W2101936356","https://openalex.org/W2107052785","https://openalex.org/W2116466689","https://openalex.org/W2131172946","https://openalex.org/W2137061851","https://openalex.org/W2216459995","https://openalex.org/W2269638945","https://openalex.org/W2326812357","https://openalex.org/W2345432430","https://openalex.org/W2574497079","https://openalex.org/W2619061098","https://openalex.org/W2767199097","https://openalex.org/W2770109286","https://openalex.org/W2808110885","https://openalex.org/W2883109957","https://openalex.org/W2943555824","https://openalex.org/W2963467070","https://openalex.org/W2971940014","https://openalex.org/W3002090153","https://openalex.org/W3098551378","https://openalex.org/W3099799842","https://openalex.org/W3100428187","https://openalex.org/W3103672205","https://openalex.org/W3203023708","https://openalex.org/W4206502013","https://openalex.org/W4240189201","https://openalex.org/W4251683043"],"related_works":["https://openalex.org/W2056597184","https://openalex.org/W1712180277","https://openalex.org/W1608414128","https://openalex.org/W2029933769","https://openalex.org/W2551034790","https://openalex.org/W2094388041","https://openalex.org/W3102280101","https://openalex.org/W2538178083","https://openalex.org/W159504299","https://openalex.org/W1968988491"],"abstract_inverted_index":{"The":[0],"degree-4":[1,46,73],"Sum-of-Squares":[2],"(SoS)":[3],"SDP":[4,48],"relaxation":[5],"is":[6],"a":[7,19,62,68],"powerful":[8],"algorithm":[9,37],"that":[10],"captures":[11],"the":[12,43,81],"best":[13],"known":[14],"polynomial":[15],"time":[16],"algorithms":[17],"for":[18,64,70],"broad":[20],"range":[21],"of":[22,45,77],"problems":[23],"including":[24],"MaxCut,":[25],"Sparsest":[26],"Cut,":[27],"all":[28],"MaxCSPs":[29],"and":[30],"tensor":[31],"PCA.":[32],"Despite":[33],"being":[34],"an":[35],"explicit":[36],"with":[38],"relatively":[39],"low":[40],"computational":[41],"complexity,":[42],"limits":[44],"SoS":[47,74],"are":[49],"not":[50,59],"well":[51],"understood.":[52],"For":[53],"example,":[54],"existing":[55],"integrality":[56],"gaps":[57],"do":[58],"rule":[60],"out":[61],"(2\u2212)-algorithm":[63],"Vertex":[65],"Cover":[66],"or":[67],"(0.878+)-algorithm":[69],"MaxCut":[71],"via":[72],"SDPs,":[75],"each":[76],"which":[78],"would":[79],"refute":[80],"notorious":[82],"Unique":[83],"Games":[84],"Conjecture.":[85]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":4}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}