{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T06:01:57Z","timestamp":1775282517478,"version":"3.50.1"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,12,24]],"date-time":"2014-12-24T00:00:00Z","timestamp":1419379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2015,3]]},"DOI":"10.1007\/s00454-014-9655-9","type":"journal-article","created":{"date-parts":[[2014,12,23]],"date-time":"2014-12-23T15:49:18Z","timestamp":1419349758000},"page":"397-401","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":31,"title":["A Short Proof that the Extension Complexity of the Correlation Polytope Grows Exponentially"],"prefix":"10.1007","volume":"53","author":[{"given":"Volker","family":"Kaibel","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Weltge","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,12,24]]},"reference":[{"key":"9655_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/978-3-642-39206-1_6","volume-title":"Automata, Languages, and Programming","author":"D Avis","year":"2013","unstructured":"Avis, D., Tiwary, H.R.: On the extension complexity of combinatorial polytopes. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M.Z., Peleg, D. (eds.) Automata, Languages, and Programming. Lecture Notes in Computer Science, vol. 7965, pp. 57\u201368. Springer, Berlin (2013)"},{"key":"9655_CR2","doi-asserted-by":"crossref","unstructured":"Braun, G., Pokutta, S.: Common information and unique disjointness. In: Foundations of Computer Science (FOCS), IEEE 54th Annual Symposium, pp. 688\u2013697 (2013)","DOI":"10.1109\/FOCS.2013.79"},{"key":"9655_CR3","doi-asserted-by":"crossref","unstructured":"Fiorini, S., Massar, S., Pokutta, S., Tiwary, H.R., de Wolf, R.: Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds. In: STOC, pp. 95\u2013106 (2012)","DOI":"10.1145\/2213977.2213988"},{"key":"9655_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-24508-4","volume-title":"Boolean Function Complexity: Advances and Frontiers","author":"S Jukna","year":"2012","unstructured":"Jukna, S.: Boolean Function Complexity: Advances and Frontiers. Springer, Berlin (2012)"},{"key":"9655_CR5","volume-title":"Communication Complexity","author":"E Kushilevitz","year":"2006","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (2006)"},{"key":"9655_CR6","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/j.orl.2013.03.010","volume":"41","author":"S Pokutta","year":"2013","unstructured":"Pokutta, S., Vyve, M.V.: A note on the extension complexity of the knapsack polytope. Oper. Res. Lett. 41, 347\u2013350 (2013)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"9655_CR7","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/0304-3975(92)90260-M","volume":"106","author":"AA Razborov","year":"1992","unstructured":"Razborov, A.A.: On the distributional complexity of disjointness. Theor. Comput. Sci. 106(2), 385\u2013390 (1992)","journal-title":"Theor. Comput. Sci."},{"key":"9655_CR8","doi-asserted-by":"crossref","unstructured":"Rothvo\u00df, T.: The matching polytope has exponential extension complexity. http:\/\/arxiv.org\/abs\/1311.2369 (2013)","DOI":"10.1145\/2591796.2591834"},{"issue":"3","key":"9655_CR9","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1137\/S0097539702407345","volume":"32","author":"R Wolf de","year":"2003","unstructured":"de Wolf, R.: Nondeterministic quantum query and communication complexities. SIAM J. Comput. 32(3), 681\u2013699 (2003)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"9655_CR10","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/0022-0000(91)90024-Y","volume":"43","author":"M Yannakakis","year":"1991","unstructured":"Yannakakis, M.: Expressing combinatorial optimization problems by linear programs. J. Comput. Syst. Sci. 43(3), 441\u2013466 (1991)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-014-9655-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-014-9655-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-014-9655-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,18]],"date-time":"2019-08-18T19:23:12Z","timestamp":1566156192000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-014-9655-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,24]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,3]]}},"alternative-id":["9655"],"URL":"https:\/\/doi.org\/10.1007\/s00454-014-9655-9","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,24]]}}}