{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:44:39Z","timestamp":1740109479708,"version":"3.37.3"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,5,23]],"date-time":"2016-05-23T00:00:00Z","timestamp":1463961600000},"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":["comput. complex."],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s00037-016-0126-y","type":"journal-article","created":{"date-parts":[[2016,5,24]],"date-time":"2016-05-24T04:10:27Z","timestamp":1464063027000},"page":"199-228","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Multipartite Quantum Correlation and Communication Complexities"],"prefix":"10.1007","volume":"26","author":[{"given":"Rahul","family":"Jain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhaohui","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Penghui","family":"Yao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shengyu","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,5,23]]},"reference":[{"key":"126_CR1","doi-asserted-by":"crossref","unstructured":"Andris Ambainis, Leonard J. Schulman, Amnon Ta-Shma, Umesh Vazirani & Avi Wigderson (2003). The Quantum Communication Complexity of Sampling. SIAM Journal on Computing 32(6): 1570\u20131585. URL http:\/\/dx.doi.org\/10.1137\/S009753979935476 .","DOI":"10.1137\/S009753979935476"},{"key":"126_CR2","first-page":"2","volume":"34","author":"Chu Moody","year":"2005","unstructured":"Moody Chu, Robert Plemmons (2005) Nonnegative matrix factorization and applications. Bulletin of the International Linear Algebra Society 34: 2\u20137","journal-title":"Bulletin of the International Linear Algebra Society"},{"key":"126_CR3","doi-asserted-by":"crossref","unstructured":"Samuel Fiorini, Serge Massar, Sebastian Pokutta, Hans Raj Tiwary & Ronald de Wolf (2015). Exponential Lower Bounds for Polytopes in Combinatorial Optimization. Journal of the ACM 62 (2), 17. ISSN 0004-5411.","DOI":"10.1145\/2716307"},{"key":"126_CR4","doi-asserted-by":"crossref","unstructured":"Prahladh Harsha, Rahul Jain, David McAllester & Jaikumar Radhakrishnan (2010). The Communication Complexity of Correlation. Information Theory, IEEE Transactions on 56(1), 438\u2013449. ISSN 0018-9448.","DOI":"10.1109\/TIT.2009.2034824"},{"key":"126_CR5","doi-asserted-by":"crossref","unstructured":"Rahul Jain, Yaoyun Shi, Zhaohui Wei & Shengyu Zhang (2013). Efficient protocols for generating bipartite classical distributions and quantum states. Information Theory, IEEE Transactions on 59(8), 5171\u20135178. ISSN 0018-9448.","DOI":"10.1109\/TIT.2013.2258372"},{"key":"126_CR6","unstructured":"Ilan Kremer (1995). Quantum Communication. Technical report, Master\u2019s thesis, The Hebrew University of Jerusalem, Jerusalem."},{"key":"126_CR7","unstructured":"L\u00e1szl\u00f3 Lov\u00e1sz (1989). Communication complexity: a survey. In book Paths, flows, and VLSI layout edited by B. Korte, L. Lov\u00e1sz, H. J. Pr\u00f6mel, and A. Schrijver. Springer-Verlag. URL http:\/\/books.google.ca\/books?id=emw8PgAACAAJ ."},{"key":"126_CR8","unstructured":"Michael A. Nielsen & Isaac L. Chuang (2011). Quantum Computation and Quantum Information: 10th Anniversary Edition. Cambridge University Press, New York, NY, USA, 10th edition. ISBN 1107002176, 9781107002173."},{"key":"126_CR9","doi-asserted-by":"crossref","unstructured":"Noam Nisan (1991). Lower Bounds for Non-commutative Computation. In Proceedings of the Twenty-third Annual ACM Symposium on Theory of Computing, STOC \u201991, 410\u2013418. ACM, New York, NY, USA. ISBN 0-89791-397-3. URL http:\/\/doi.acm.org\/10.1145\/103418.103462 .","DOI":"10.1145\/103418.103462"},{"key":"126_CR10","doi-asserted-by":"crossref","unstructured":"Mihalis Yannakakis (1988). Expressing Combinatorial Optimization Problems by Linear Programs. In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC \u201988, 223\u2013228. ACM, New York, NY, USA. ISBN 0-89791-264-0. URL http:\/\/doi.acm.org\/10.1145\/62212.62232 .","DOI":"10.1145\/62212.62232"},{"key":"126_CR11","doi-asserted-by":"crossref","unstructured":"Shengyu Zhang (2012). Quantum Strategic Game Theory. In Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, ITCS \u201912, 39\u201359. ACM, New York, NY, USA. ISBN 978-1-4503-11151. URL http:\/\/doi.acm.org\/10.1145\/2090236.2090241 .","DOI":"10.1145\/2090236.2090241"}],"container-title":["computational complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00037-016-0126-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00037-016-0126-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00037-016-0126-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00037-016-0126-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T11:01:59Z","timestamp":1558522919000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00037-016-0126-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,23]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["126"],"URL":"https:\/\/doi.org\/10.1007\/s00037-016-0126-y","relation":{},"ISSN":["1016-3328","1420-8954"],"issn-type":[{"type":"print","value":"1016-3328"},{"type":"electronic","value":"1420-8954"}],"subject":[],"published":{"date-parts":[[2016,5,23]]}}}