{"id":"https://openalex.org/W2031923588","doi":"https://doi.org/10.1145/2746539.2746599","title":"Lower Bounds on the Size of Semidefinite Programming Relaxations","display_name":"Lower Bounds on the Size of Semidefinite Programming Relaxations","publication_year":2015,"publication_date":"2015-06-03","ids":{"openalex":"https://openalex.org/W2031923588","doi":"https://doi.org/10.1145/2746539.2746599","mag":"2031923588"},"language":"en","primary_location":{"id":"doi:10.1145/2746539.2746599","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2746539.2746599","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":"conference-paper","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/A5028879014","display_name":"James R. Lee","orcid":"https://orcid.org/0000-0002-3512-1617"},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"James R. Lee","raw_affiliation_strings":["University of Washington, Seattle, WA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Washington, Seattle, WA, USA","institution_ids":["https://openalex.org/I201448701"]}]},{"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/I134446601","display_name":"Berkeley College","ror":"https://ror.org/02xewxa75","country_code":"US","type":"education","lineage":["https://openalex.org/I134446601"]},{"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":["UC Berkeley, Berkeley, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UC Berkeley, Berkeley, CA, USA","institution_ids":["https://openalex.org/I134446601","https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089128021","display_name":"David Steurer","orcid":"https://orcid.org/0000-0002-3908-8180"},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David Steurer","raw_affiliation_strings":["Cornell, Ithaca, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Cornell, Ithaca, NY, USA","institution_ids":["https://openalex.org/I205783295"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":141,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"567","last_page":"576"},"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.9995999932289124,"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.9995999932289124,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9975000023841858,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9973000288009644,"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/semidefinite-programming","display_name":"Semidefinite programming","score":0.906252384185791},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.8748492002487183},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6507358551025391},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6390658020973206},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5816783905029297},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5659770965576172},{"id":"https://openalex.org/keywords/semidefinite-embedding","display_name":"Semidefinite embedding","score":0.531191349029541},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5132753849029541},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5067480206489563},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.4737490117549896},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.43244534730911255},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.4316543936729431},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.41795873641967773},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37451833486557007},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.31606078147888184},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.24756741523742676},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20571103692054749},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.18854767084121704},{"id":"https://openalex.org/keywords/quadratically-constrained-quadratic-program","display_name":"Quadratically constrained quadratic program","score":0.18770679831504822},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.0880938470363617}],"concepts":[{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.906252384185791},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.8748492002487183},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6507358551025391},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6390658020973206},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5816783905029297},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5659770965576172},{"id":"https://openalex.org/C206818286","wikidata":"https://www.wikidata.org/wiki/Q7449403","display_name":"Semidefinite embedding","level":4,"score":0.531191349029541},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5132753849029541},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5067480206489563},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.4737490117549896},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.43244534730911255},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.4316543936729431},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.41795873641967773},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37451833486557007},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.31606078147888184},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.24756741523742676},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20571103692054749},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.18854767084121704},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.18770679831504822},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.0880938470363617},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2746539.2746599","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2746539.2746599","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":[{"id":"https://openalex.org/F4320334164","display_name":"Simons Institute for the Theory of Computing, University of California Berkeley","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":48,"referenced_works":["https://openalex.org/W245337057","https://openalex.org/W1505731132","https://openalex.org/W1537145174","https://openalex.org/W1858857015","https://openalex.org/W1891181203","https://openalex.org/W1899379166","https://openalex.org/W1966395945","https://openalex.org/W1967344706","https://openalex.org/W1981566278","https://openalex.org/W1985123706","https://openalex.org/W1995547833","https://openalex.org/W1999590989","https://openalex.org/W2012805418","https://openalex.org/W2016070790","https://openalex.org/W2016384870","https://openalex.org/W2022749269","https://openalex.org/W2028932986","https://openalex.org/W2033871299","https://openalex.org/W2038907843","https://openalex.org/W2061987651","https://openalex.org/W2066620631","https://openalex.org/W2069816168","https://openalex.org/W2078561631","https://openalex.org/W2079473728","https://openalex.org/W2088844265","https://openalex.org/W2099677042","https://openalex.org/W2107052785","https://openalex.org/W2110871651","https://openalex.org/W2115318789","https://openalex.org/W2119368733","https://openalex.org/W2120358419","https://openalex.org/W2133404041","https://openalex.org/W2146777332","https://openalex.org/W2154094669","https://openalex.org/W2159584454","https://openalex.org/W2165281529","https://openalex.org/W2188989666","https://openalex.org/W2295961103","https://openalex.org/W2534717833","https://openalex.org/W2611804663","https://openalex.org/W2789043785","https://openalex.org/W2901191490","https://openalex.org/W2949885909","https://openalex.org/W2950706437","https://openalex.org/W2951982454","https://openalex.org/W3099415239","https://openalex.org/W3123950972","https://openalex.org/W6785242814"],"related_works":["https://openalex.org/W2366269287","https://openalex.org/W579949368","https://openalex.org/W121484681","https://openalex.org/W4289367511","https://openalex.org/W2132400628","https://openalex.org/W2952554274","https://openalex.org/W2066492681","https://openalex.org/W3000089047","https://openalex.org/W2118059629","https://openalex.org/W2356944478"],"abstract_inverted_index":{"We":[0],"introduce":[1],"a":[2],"method":[3],"for":[4,16,54],"proving":[5],"lower":[6,66],"bounds":[7,67],"on":[8,31,68],"the":[9,24,36,40,63,69],"efficacy":[10],"of":[11,39,43,49,73,77],"semidefinite":[12,70],"programming":[13],"(SDP)":[14],"relaxations":[15],"combinatorial":[17],"problems.":[18],"In":[19],"particular,":[20],"we":[21],"show":[22],"that":[23],"cut,":[25],"TSP,":[26],"and":[27],"stable":[28],"set":[29],"polytopes":[30],"n-vertex":[32],"graphs":[33],"are":[34],"not":[35],"linear":[37],"image":[38],"feasible":[41],"region":[42],"any":[44,47,74],"SDP":[45],"(i.e.,":[46],"spectrahedron)":[48],"dimension":[50],"less":[51],"than":[52],"2n\u03b4,":[53],"some":[55],"constant":[56],"\u03b4":[57],">":[58],"0.":[59],"This":[60],"result":[61],"yields":[62],"first":[64],"super-polynomial":[65],"extension":[71],"complexity":[72],"explicit":[75],"family":[76],"polytopes.":[78]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":10},{"year":2022,"cited_by_count":12},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":14},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":14},{"year":2017,"cited_by_count":26},{"year":2016,"cited_by_count":21},{"year":2015,"cited_by_count":13},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}