{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T10:05:46Z","timestamp":1775729146676,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,3,13]],"date-time":"2018-03-13T00:00:00Z","timestamp":1520899200000},"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":[[2019,4]]},"DOI":"10.1007\/s00454-018-9988-x","type":"journal-article","created":{"date-parts":[[2018,3,13]],"date-time":"2018-03-13T13:58:08Z","timestamp":1520949488000},"page":"653-660","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Euclidean Distance Matrices and Separations in Communication Complexity Theory"],"prefix":"10.1007","volume":"61","author":[{"given":"Yaroslav","family":"Shitov","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,13]]},"reference":[{"key":"9988_CR1","doi-asserted-by":"publisher","first-page":"2330","DOI":"10.1016\/j.laa.2009.02.034","volume":"431","author":"LB Beasley","year":"2009","unstructured":"Beasley, L.B., Laffey, T.J.: Real rank versus nonnegative rank. Linear Algebra Appl. 431, 2330\u20132335 (2009)","journal-title":"Linear Algebra Appl."},{"issue":"3","key":"9988_CR2","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1287\/moor.2014.0694","volume":"40","author":"G Braun","year":"2015","unstructured":"Braun, G., Fiorini, S., Pokutta, S., Steurer, D.: Approximation limits of linear programs (beyond hierarchies). Math. Oper. Res. 40(3), 756\u2013772 (2015)","journal-title":"Math. Oper. Res."},{"key":"9988_CR3","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0024-3795(93)90224-C","volume":"190","author":"JE Cohen","year":"1993","unstructured":"Cohen, J.E., Rothblum, U.G.: Nonnegative ranks, decompositions, and factorizations of nonnegative matrices. Linear Algebra Appl. 190, 149\u2013168 (1993)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"9988_CR4","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s10107-014-0755-3","volume":"153","author":"Y Faenza","year":"2015","unstructured":"Faenza, Y., Fiorini, S., Grappe, R., Tiwary, H.R.: Extended formulations, nonnegative factorizations, and randomized communication protocols. Math. Program. 153(1), 75\u201394 (2015)","journal-title":"Math. Program."},{"issue":"1","key":"9988_CR5","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s10107-015-0922-1","volume":"153","author":"H Fawzi","year":"2015","unstructured":"Fawzi, H., Gouveia, J., Parrilo, P.A., Robinson, R.Z., Thomas, R.R.: Positive semidefinite rank. Math. Program. 153(1), 133\u2013177 (2015)","journal-title":"Math. Program."},{"key":"9988_CR6","doi-asserted-by":"crossref","unstructured":"Fiorini, S., Massar, S., Pokutta, S., Tiwary, H.R., de Wolf, R.: Exponential lower bounds for polytopes in combinatorial optimization. J. ACM 62(2) (2015). Art. No. 17","DOI":"10.1145\/2716307"},{"issue":"3","key":"9988_CR7","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1007\/s00454-012-9421-9","volume":"48","author":"S Fiorini","year":"2012","unstructured":"Fiorini, S., Rothvo\u00df, T., Tiwary, H.R.: Extended formulations for polygons. Discrete Comput. Geom. 48(3), 658\u2013668 (2012)","journal-title":"Discrete Comput. Geom."},{"issue":"11","key":"9988_CR8","doi-asserted-by":"publisher","first-page":"2685","DOI":"10.1016\/j.laa.2012.06.038","volume":"437","author":"N Gillis","year":"2012","unstructured":"Gillis, N., Glineur, F.: On the geometric interpretation of the nonnegative rank. Linear Algebra Appl. 437(11), 2685\u20132712 (2012)","journal-title":"Linear Algebra Appl."},{"key":"9988_CR9","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/j.jcta.2016.08.002","volume":"145","author":"J Gouveia","year":"2017","unstructured":"Gouveia, J., Pashkovich, K., Robinson, R.R., Thomas, R.R.: Four dimensional polytopes of minimum positive semidefinite rank. J. Comb. Theory A 145, 184\u2013226 (2017)","journal-title":"J. Comb. Theory A"},{"issue":"11","key":"9988_CR10","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.ipl.2012.02.009","volume":"112","author":"P Hrube\u0161","year":"2012","unstructured":"Hrube\u0161, P.: On the nonnegative rank of distance matrices. Inf. Process. Lett. 112(11), 457\u2013461 (2012)","journal-title":"Inf. Process. Lett."},{"issue":"8","key":"9988_CR11","doi-asserted-by":"publisher","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(8), 5171\u20135178 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"9988_CR12","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1214\/14-AOS1282","volume":"43","author":"K Kubjas","year":"2015","unstructured":"Kubjas, K., Robeva, E., Sturmfels, B.: Fixed points of the EM algorithm and nonnegative rank boundaries. Ann. Stat. 43(1), 422\u2013461 (2015)","journal-title":"Ann. Stat."},{"key":"9988_CR13","volume-title":"Communication Complexity","author":"E Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)"},{"key":"9988_CR14","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1038\/44565","volume":"401","author":"DD Lee","year":"1999","unstructured":"Lee, D.D., Seung, S.H.: Learning the parts of objects by non-negative matrix factorization. Nature 401, 788\u2013791 (1999)","journal-title":"Nature"},{"issue":"1\u20132","key":"9988_CR15","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s10107-016-1052-0","volume":"162","author":"T Lee","year":"2017","unstructured":"Lee, T., Zhaohui, W., de Wolf, R.: Some upper and lower bounds on PSD-rank. Math. Program. 162(1\u20132), 495\u2013521 (2017)","journal-title":"Math. Program."},{"issue":"4","key":"9988_CR16","doi-asserted-by":"publisher","first-page":"2162","DOI":"10.1137\/16M1063721","volume":"30","author":"A Padrol","year":"2016","unstructured":"Padrol, A.: Extension complexity of polytopes with few vertices or facets. SIAM J. Discrete Math. 30(4), 2162\u20132176 (2016)","journal-title":"SIAM J. Discrete Math."},{"key":"9988_CR17","unstructured":"Padrol, A., Pfeifle, J.: Polygons as sections of higher-dimensional polytopes. Electron. J. Comb. 22(1) (2015). Art. No. 24"},{"key":"9988_CR18","unstructured":"Pashkovich, K.: Extended Formulations for Combinatorial Polytopes. PhD thesis, Magdeburg Universit\u00e4t (2012)"},{"key":"9988_CR19","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.jcta.2013.10.004","volume":"122","author":"Ya Shitov","year":"2014","unstructured":"Shitov, Ya.: An upper bound for nonnegative rank. J. Comb. Theory Ser. A 122, 126\u2013132 (2014)","journal-title":"J. Comb. Theory Ser. A"},{"key":"9988_CR20","unstructured":"Shitov, Ya.: Sublinear extensions of polygons (2014). \n                    arXiv:1412.0728"},{"issue":"3","key":"9988_CR21","doi-asserted-by":"publisher","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":"9988_CR22","doi-asserted-by":"crossref","unstructured":"Zhang, S.: Quantum strategic game theory. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (ITCS\u201912), pp. 39\u201359. ACM, New York (2012)","DOI":"10.1145\/2090236.2090241"}],"container-title":["Discrete &amp; Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-018-9988-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-018-9988-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-018-9988-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T20:29:30Z","timestamp":1552422570000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-018-9988-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,13]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["9988"],"URL":"https:\/\/doi.org\/10.1007\/s00454-018-9988-x","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3,13]]},"assertion":[{"value":"7 July 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 February 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 March 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 March 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}