{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T01:54:34Z","timestamp":1771379674591,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2016,7,16]],"date-time":"2016-07-16T00:00:00Z","timestamp":1468627200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001381","name":"Singapore National Research Foundation","doi-asserted-by":"crossref","award":["NRF RF Award No. NRF-NRFF2013-13"],"award-info":[{"award-number":["NRF RF Award No. NRF-NRFF2013-13"]}],"id":[{"id":"10.13039\/501100001381","id-type":"DOI","asserted-by":"crossref"}]},{"name":"ERC Consolidator Grant QPROGRESS"},{"name":"EU STREP project QALGO","award":["600700"],"award-info":[{"award-number":["600700"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s10107-016-1052-0","type":"journal-article","created":{"date-parts":[[2016,7,16]],"date-time":"2016-07-16T00:17:57Z","timestamp":1468628277000},"page":"495-521","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Some upper and lower bounds on PSD-rank"],"prefix":"10.1007","volume":"162","author":[{"given":"Troy","family":"Lee","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7831-1082","authenticated-orcid":false,"given":"Zhaohui","family":"Wei","sequence":"additional","affiliation":[]},{"given":"Ronald","family":"de Wolf","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,16]]},"reference":[{"issue":"2","key":"1052_CR1","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1287\/moor.1120.0575","volume":"38","author":"J Gouveia","year":"2013","unstructured":"Gouveia, J., Parrilo, P., Thomas, R.: Lifts of convex sets and cone factorizations. Math. Oper. Res. 38(2), 248\u2013264 (2013). arXiv:1111.3164","journal-title":"Math. Oper. Res."},{"key":"1052_CR2","doi-asserted-by":"crossref","unstructured":"Fiorini, S., Massar, S., Pokutta, S., Tiwary, H.\u00a0R. and de Wolf, R.: Exponential lower bounds for polytopes in combinatorial optimization. J. ACM, 16(2), 2015. Earlier version in STOC\u201912. arXiv:1111.0837","DOI":"10.1145\/2716307"},{"issue":"3","key":"1052_CR3","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."},{"key":"1052_CR4","doi-asserted-by":"crossref","unstructured":"Rothvo\u00df, T.: The matching polytope has exponential extension complexity. In: Proceedings of 46th ACM STOC, pp. 263\u2013272 (2014)","DOI":"10.1145\/2591796.2591834"},{"key":"1052_CR5","unstructured":"Lee, J., Steurer, D. and Raghavendra, P.: Lower bounds on the size of semidefinite programming relaxations. In: Proceedings of 47th ACM STOC, pp. 567\u2013576 (2015). arXiv:1411.6317"},{"key":"1052_CR6","unstructured":"Lee, T. and Wei, Z.: The square root rank of the correlation polytope is exponential (2014). arXiv:1411.6712"},{"key":"1052_CR7","unstructured":"Conforti, M., Faenza, Y., Fiorini, S. and Tiwary, H.R.: Extended formulations, non-negative factorizations and randomized communication protocols. In: 2nd International Symposium on Combinatorial Optimization, pp. 129\u2013140 (2012). arXiv:1105.4127"},{"key":"1052_CR8","unstructured":"Zhang, S.: Quantum strategic game theory. In: Proceedings of the 3rd Innovations in Theoretical Computer Science, pp 39\u201359 (2012). arXiv:1012.5141"},{"key":"1052_CR9","doi-asserted-by":"crossref","first-page":"5171","DOI":"10.1109\/TIT.2013.2258372","volume":"59","author":"R Jain","year":"2013","unstructured":"Jain, R., Shi, Y., Wei, Z., Zhang, S.: Efficient protocols for generating bipartite classical distributions and quantum states. IEEE Trans. Inf. Theory 59, 5171\u20135178 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1052_CR10","doi-asserted-by":"crossref","DOI":"10.1016\/S0065-2458(08)60342-3","volume-title":"Communication Complexity","author":"E Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)"},{"key":"1052_CR11","unstructured":"Lee, T. and Theis, D.O.: Support based bounds for positive semidefinite rank (2012). arXiv:1203.3961"},{"key":"1052_CR12","unstructured":"Sikora, J., Varvitsiotis, A. and Wei, Z.: On the minimum dimension of a Hilbert space needed to generate a quantum correlation (2015). arXiv:1507.00213"},{"key":"1052_CR13","volume-title":"Quantum Computation and Quantum Information","author":"M Nielsen","year":"2000","unstructured":"Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)"},{"issue":"2","key":"1052_CR14","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1287\/moor.26.2.193.10561","volume":"26","author":"A Ben-Tal","year":"2001","unstructured":"Ben-Tal, A., Nemirovski, A.: On polyhedral approximations of the second-order cone. Math. Oper. Res. 26(2), 193\u2013205 (2001)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"1052_CR15","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/s10107-014-0837-2","volume":"153","author":"H Fawzi","year":"2015","unstructured":"Fawzi, H., Parrilo, P.: Lower bounds on nonnegative rank via nonnegative nuclear norms. Math. Program., Ser. B 153(1), 41\u201366 (2015). arXiv:1210.6970","journal-title":"Math. Program., Ser. B"},{"issue":"1","key":"1052_CR16","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/s10107-015-0922-1","volume":"153","author":"H Fawzi","year":"2015","unstructured":"Fawzi, H., Gouveia, J., Parrilo, P., Robinson, R., Thomas, R.: Positive semidefinite rank. Math. Program., Ser. B 153(1), 133\u2013177 (2015). arXiv:1407.4095","journal-title":"Math. Program., Ser. B"},{"key":"1052_CR17","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1017\/S0963548307008917","volume":"18","author":"N Alon","year":"2009","unstructured":"Alon, N.: Perturbed identity matrices have high rank: proof and applications. Combin., Prob., Comput. 18, 3\u201315 (2009)","journal-title":"Combin., Prob., Comput."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1052-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-016-1052-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1052-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1052-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T03:12:14Z","timestamp":1568171534000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-016-1052-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,16]]},"references-count":17,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["1052"],"URL":"https:\/\/doi.org\/10.1007\/s10107-016-1052-0","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,7,16]]}}}