{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:26:47Z","timestamp":1743049607126,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642299513"},{"type":"electronic","value":"9783642299520"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29952-0_39","type":"book-chapter","created":{"date-parts":[[2012,5,3]],"date-time":"2012-05-03T06:14:09Z","timestamp":1336025649000},"page":"400-411","source":"Crossref","is-referenced-by-count":1,"title":["Tensor Rank and Strong Quantum Nondeterminism in Multiparty Communication"],"prefix":"10.1007","author":[{"given":"Marcos","family":"Villagra","sequence":"first","affiliation":[]},{"given":"Masaki","family":"Nakanishi","sequence":"additional","affiliation":[]},{"given":"Shigeru","family":"Yamashita","sequence":"additional","affiliation":[]},{"given":"Yasuhiko","family":"Nakashima","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Alexeev, B., Forbes, M., Tsimerman, J.: Tensor rank: Some lower and upper bounds. In: Proceedings of the 26th Annual IEEE Conference on Computational Complexity (2011)","key":"39_CR1","DOI":"10.1109\/CCC.2011.28"},{"doi-asserted-by":"crossref","unstructured":"Buhrman, H., de Wolf, R.: Communication complexity lower bounds by polynomials. In: Proceedings of the 16th Annual IEEE Conference on Computational Complexity, pp. 120\u2013130 (2001)","key":"39_CR2","DOI":"10.1109\/CCC.2001.933879"},{"doi-asserted-by":"crossref","unstructured":"Gavinsky, D., Pudl\u00e1k, P.: Exponential separation of quantum and classical non-interactive multi-party communication complexity. In: Proceedings of the 23rd IEEE Annual Conference on Computational Complexity, pp. 332\u2013339 (2008)","key":"39_CR3","DOI":"10.1109\/CCC.2008.27"},{"issue":"4","key":"39_CR4","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1016\/0196-6774(90)90014-6","volume":"11","author":"J. H\u00e5stad","year":"1990","unstructured":"H\u00e5stad, J.: Tensor rank is np-complete. Journal of Algorithms\u00a011(4), 644\u2013654 (1990)","journal-title":"Journal of Algorithms"},{"key":"39_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-540-72504-6_28","volume-title":"Theory and Applications of Models of Computation","author":"I. Kerenidis","year":"2007","unstructured":"Kerenidis, I.: Quantum Multiparty Communication Complexity and Circuit Lower Bounds. In: Cai, J.-Y., Cooper, S.B., Zhu, H. (eds.) TAMC 2007. LNCS, vol.\u00a04484, pp. 306\u2013317. Springer, Heidelberg (2007)"},{"issue":"3","key":"39_CR6","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1137\/07070111X","volume":"51","author":"T. Kolda","year":"2009","unstructured":"Kolda, T., Bader, B.: Tensor decompositions and applications. SIAM Review\u00a051(3), 455\u2013500 (2009)","journal-title":"SIAM Review"},{"doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press (1997)","key":"39_CR7","DOI":"10.1017\/CBO9780511574948"},{"key":"39_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1007\/11821069_57","volume-title":"Mathematical Foundations of Computer Science 2006","author":"F. Gall Le","year":"2006","unstructured":"Le Gall, F.: Quantum Weakly Nondeterministic Communication Complexity. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol.\u00a04162, pp. 658\u2013669. Springer, Heidelberg (2006)"},{"doi-asserted-by":"crossref","unstructured":"Lee, T., Schechtman, G., Shraibman, A.: Lower bounds on quantum multiparty communication complexity. In: Proceedings of the 24th IEEE Conference on Computational Complexity (2009)","key":"39_CR9","DOI":"10.1109\/CCC.2009.24"},{"doi-asserted-by":"crossref","unstructured":"Lee, T., Shraibman, A.: Disjointness Is Hard in the Multi-party Number-on-the-Forehead Model. In: Proceedings of the 23rd IEEE Annual Conference on Computational Complexity (2008)","key":"39_CR10","DOI":"10.1109\/CCC.2008.29"},{"unstructured":"Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information. Cambridge University Press (2000)","key":"39_CR11"},{"key":"39_CR12","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/PL00001602","volume":"9","author":"R. Raz","year":"2000","unstructured":"Raz, R.: The bns-chung criterion for multi-party communication complexity. Computational Complexity\u00a09, 113\u2013122 (2000)","journal-title":"Computational Complexity"},{"doi-asserted-by":"crossref","unstructured":"Raz, R.: Tensor-rank and lower bounds for arithmetical formulas. In: Proceedings of the 42nd ACM Symposium on Theory of Computing, pp. 659\u2013666 (2010)","key":"39_CR13","DOI":"10.1145\/1806689.1806780"},{"doi-asserted-by":"crossref","unstructured":"Villagra, M., Nakanishi, M., Yamashita, S., Nakashima, Y.: Tensor rank and strong quantum nondeterminism in multiparty communication. Tech. Rep. TR12-004, Electronic Colloqium on Computational Complexity (2012)","key":"39_CR14","DOI":"10.1007\/978-3-642-29952-0_39"},{"doi-asserted-by":"crossref","unstructured":"de Wolf, R.: Characterization of non-deterministic quantum query and quantum communication complexity. In: Proceedings of the 15th Annual IEEE Conference on Computational Complexity, pp. 271\u2013278 (2000)","key":"39_CR15","DOI":"10.1109\/CCC.2000.856758"},{"issue":"3","key":"39_CR16","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1137\/S0097539702407345","volume":"32","author":"R. Wolf de","year":"2003","unstructured":"de Wolf, R.: Nondeterministic quantum query and quantum communication complexities. SIAM Journal on Computing\u00a032(3), 681\u2013699 (2003)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29952-0_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:54:40Z","timestamp":1743044080000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29952-0_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642299513","9783642299520"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29952-0_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}