{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T02:43:52Z","timestamp":1782441832087,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,6,14]],"date-time":"2015-06-14T00:00:00Z","timestamp":1434240000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Science Foundation","award":["CCF-1407779"],"award-info":[{"award-number":["CCF-1407779"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,6,14]]},"DOI":"10.1145\/2746539.2746599","type":"proceedings-article","created":{"date-parts":[[2015,6,3]],"date-time":"2015-06-03T15:35:56Z","timestamp":1433345756000},"page":"567-576","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":74,"title":["Lower Bounds on the Size of Semidefinite Programming Relaxations"],"prefix":"10.1145","author":[{"given":"James R.","family":"Lee","sequence":"first","affiliation":[{"name":"University of Washington, Seattle, WA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Prasad","family":"Raghavendra","sequence":"additional","affiliation":[{"name":"UC Berkeley, Berkeley, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Steurer","sequence":"additional","affiliation":[{"name":"Cornell, Ithaca, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2015,6,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250823"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1502793.1502794"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/070711670"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214006"},{"key":"e_1_3_2_1_5_1","first-page":"217","volume-title":"Sophia Antipolis","author":"Bri\u00ebt Jop","year":"2013","unstructured":"Jop Bri\u00ebt , Daniel Dadush , and Sebastian Pokutta . On the existence of 0\/1 polytopes with high semidefinite extension complexity. In Algorithms - ESA 2013 - 21st Annual European Symposium , Sophia Antipolis , France , September 2-4, 2013 . Proceedings, pages 217 -- 228 , 2013. Jop Bri\u00ebt, Daniel Dadush, and Sebastian Pokutta. On the existence of 0\/1 polytopes with high semidefinite extension complexity. In Algorithms - ESA 2013 - 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings, pages 217--228, 2013."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.10"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591886"},{"key":"e_1_3_2_1_8_1","volume-title":"Sum-of-squares proofs and the quest toward optimal algorithms. CoRR, abs\/1404.5236","author":"Barak Boaz","year":"2014","unstructured":"Boaz Barak and David Steurer . Sum-of-squares proofs and the quest toward optimal algorithms. CoRR, abs\/1404.5236 , 2014 . Boaz Barak and David Steurer. Sum-of-squares proofs and the quest toward optimal algorithms. CoRR, abs\/1404.5236, 2014."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(02)00231-6"},{"key":"e_1_3_2_1_10_1","volume-title":"Theory of convex optimization for machine learning. arXiv:1405.4980","author":"Bubeck S.","year":"2014","unstructured":"S. Bubeck . Theory of convex optimization for machine learning. arXiv:1405.4980 , 2014 . S. Bubeck. Theory of convex optimization for machine learning. arXiv:1405.4980, 2014."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/529\/10428"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1082036.1082038"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.45"},{"key":"e_1_3_2_1_14_1","volume-title":"Positive semidefinite rank. Arxiv, arXiv:1407.4095","author":"Fawzi Hamza","year":"2014","unstructured":"Hamza Fawzi , Jo\u00e3o Gouveia , Pablo A. Parrilo , Richard Z. Robinson , and Rekha R. Thomas . Positive semidefinite rank. Arxiv, arXiv:1407.4095 , 2014 . Hamza Fawzi, Jo\u00e3o Gouveia, Pablo A. Parrilo, Richard Z. Robinson, and Rekha R. Thomas. Positive semidefinite rank. Arxiv, arXiv:1407.4095, 2014."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2213988"},{"key":"e_1_3_2_1_16_1","volume-title":"Equivariant semidefinite lifts and sum-of-squares hierarchies. arXiv:1312.6662","author":"Fawzi H.","year":"2013","unstructured":"H. Fawzi , J. Saunderson , and P. A. Parrilo . Equivariant semidefinite lifts and sum-of-squares hierarchies. arXiv:1312.6662 , 2013 . H. Fawzi, J. Saunderson, and P. A. Parrilo. Equivariant semidefinite lifts and sum-of-squares hierarchies. arXiv:1312.6662, 2013."},{"key":"e_1_3_2_1_17_1","volume-title":"Lifts of convex sets and cone factorizations. arXiv:1111.3164","author":"Gouveia J.","year":"2011","unstructured":"J. Gouveia , P. A. Parrilo , and R. Thomas . Lifts of convex sets and cone factorizations. arXiv:1111.3164 , 2011 . J. Gouveia, P. A. Parrilo, and R. Thomas. Lifts of convex sets and cone factorizations. arXiv:1111.3164, 2011."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-001-8192-0"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00157-2"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0168-0072(01)00055-0"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/227683.227684"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780628"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.510017"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.49"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/274787.274791"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623400366802"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-09686-5_7"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2014.10"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167172"},{"key":"e_1_3_2_1_30_1","volume-title":"Problem complexity and method efficiency in optimization","author":"Nemirovsky A. S.","year":"1983","unstructured":"A. S. Nemirovsky and D. B. Yudin . Problem complexity and method efficiency in optimization . A Wiley-Interscience Publication. John Wiley & Sons , Inc., New York, 1983 . Translated from the Russian and with a preface by E. R. Dawson, Wiley-Interscience Series in Discrete Mathematics. A. S. Nemirovsky and D. B. Yudin. Problem complexity and method efficiency in optimization. A Wiley-Interscience Publication. John Wiley & Sons, Inc., New York, 1983. Translated from the Russian and with a preface by E. R. Dawson, Wiley-Interscience Series in Discrete Mathematics."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/2683783"},{"key":"e_1_3_2_1_32_1","volume-title":"Approximability and proof complexity. CoRR, abs\/1211.1958","author":"O'Donnell Ryan","year":"2012","unstructured":"Ryan O'Donnell and Yuan Zhou . Approximability and proof complexity. CoRR, abs\/1211.1958 , 2012 . Ryan O'Donnell and Yuan Zhou. Approximability and proof complexity. CoRR, abs\/1211.1958, 2012."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374414"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Thomas Rothvo\u00df. Some 0\/1 polytopes need exponential size extended formulations. Math. Program. 142(1-2 Ser. A):255--268 2013.  Thomas Rothvo\u00df. Some 0\/1 polytopes need exponential size extended formulations. Math. Program. 142(1-2 Ser. A):255--268 2013.","DOI":"10.1007\/s10107-012-0574-3"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591834"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.74"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01074929"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/1046920.1088706"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/500776"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.5555\/2505455"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-011-5269-0"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.5555\/1971947"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(91)90024-Y"}],"event":{"name":"STOC '15: Symposium on Theory of Computing","location":"Portland Oregon USA","acronym":"STOC '15","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-seventh annual ACM symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2746539.2746599","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2746539.2746599","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T18:56:04Z","timestamp":1750272964000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2746539.2746599"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,14]]},"references-count":43,"alternative-id":["10.1145\/2746539.2746599","10.1145\/2746539"],"URL":"https:\/\/doi.org\/10.1145\/2746539.2746599","relation":{},"subject":[],"published":{"date-parts":[[2015,6,14]]},"assertion":[{"value":"2015-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}