{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T23:40:03Z","timestamp":1748562003177,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662480533"},{"type":"electronic","value":"9783662480540"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48054-0_11","type":"book-chapter","created":{"date-parts":[[2015,8,10]],"date-time":"2015-08-10T11:57:29Z","timestamp":1439207849000},"page":"127-138","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Equality, Revisited"],"prefix":"10.1007","author":[{"given":"Ralph","family":"Bottesch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dmitry","family":"Gavinsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hartmut","family":"Klauck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,11]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Aaronson, S.: Limitations of quantum advice and one-way communication. In: Proceedings of the 19th IEEE Conference on Computational Complexity, pp. 320\u2013332 (2004)","DOI":"10.1109\/CCC.2004.1313854"},{"key":"11_CR2","unstructured":"Aaronson, S.: QMA\/qpoly $$\\subseteq $$ pspace\/poly: de-merlinizing quantum protocols. In: Proceedings of 21st IEEE Conference on Computational Complexity (2006)"},{"issue":"3","key":"11_CR3","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/BF01955678","volume":"16","author":"A Ambainis","year":"1996","unstructured":"Ambainis, A.: Communication complexity in a 3-computer model. Algorithmica 16(3), 298\u2013301 (1996)","journal-title":"Algorithmica"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Babai, L., Kimmel, P.: Randomized simultaneous messages: solution of a problem of yao in communication complexity. In: Proceedings of the 12th Annual IEEE Conference on Computational Complexity, p. 239 (1997)","DOI":"10.1109\/CCC.1997.612319"},{"issue":"16","key":"11_CR5","doi-asserted-by":"publisher","first-page":"167902","DOI":"10.1103\/PhysRevLett.87.167902","volume":"87","author":"H Buhrman","year":"2001","unstructured":"Buhrman, H., Cleve, R., Watrous, J., de Wolf, R.: Quantum Fingerprinting. Phys. Rev. Lett. 87(16), 167902 (2001)","journal-title":"Phys. Rev. Lett."},{"issue":"1","key":"11_CR6","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1002\/rsa.10073","volume":"22","author":"S Dasgupta","year":"2003","unstructured":"Dasgupta, S., Gupta, A.: An elementary proof of a theorem of johnson and lindenstrauss. Random Struct. Algorithms 22(1), 60\u201365 (2003)","journal-title":"Random Struct. Algorithms"},{"issue":"4","key":"11_CR7","doi-asserted-by":"publisher","first-page":"1216","DOI":"10.1109\/18.761271","volume":"45","author":"CA Fuchs","year":"1999","unstructured":"Fuchs, C.A., van de Graaf, J.: Cryptographic distinguishability measures for quantum-mechanical states. IEEE Trans. Inf. Theory 45(4), 1216\u20131227 (1999)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"11_CR8","unstructured":"Gavinsky, D., Regev, O., de Wolf, R.: Simultaneous communication protocols with quantum and classical messages. Chicago J. Theor. Comput. Sci. 7 (2008)"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"99","DOI":"10.2140\/pjm.1981.96.99","volume":"96","author":"F Hiai","year":"1981","unstructured":"Hiai, F., Ohya, M., Tsukada, M.: Sufficiency, KMS condition and relative entropy in von neumann algebras. Pacific J. Math. 96, 99\u2013109 (1981)","journal-title":"Pacific J. Math."},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Klauck, H., Nayak, A., Ta-Shma, A., Zuckerman, D.: Interaction in quantum communication and the complexity of set disjointness. In: Proceedings of 33rd ACM STOC, pp. 124\u2013133 (2001)","DOI":"10.1145\/380752.380786"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/978-3-662-44465-8_38","volume-title":"Mathematical Foundations of Computer Science 2014","author":"H Klauck","year":"2014","unstructured":"Klauck, H., Podder, S.: Two results about quantum messages. In: Csuhaj-Varj\u00fa, E., Dietzfelbinger, M., \u00c9sik, Z. (eds.) MFCS 2014, Part II. LNCS, vol. 8635, pp. 445\u2013456. Springer, Heidelberg (2014)"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-540-24587-2_21","volume-title":"Algorithms and Computation","author":"H Kobayashi","year":"2003","unstructured":"Kobayashi, H., Matsumoto, K., Yamakami, T.: Quantum merlin-arthur proof systems: are multiple merlins more helpful to arthur? In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol. 2906, pp. 189\u2013198. Springer, Heidelberg (2003)"},{"key":"11_CR13","doi-asserted-by":"publisher","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, New York (1997)"},{"issue":"2","key":"11_CR14","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0020-0190(91)90157-D","volume":"39","author":"I Newman","year":"1991","unstructured":"Newman, I.: Private vs. common random bits in communication complexity. Inf. Process. Lett. 39(2), 67\u201371 (1991)","journal-title":"Inf. Process. Lett."},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Newman, I., Szegedy,v: Public vs. private coin flips in one round communication games. In: Proceedings of the 28th Symposium on Theory of Computing, pp. 561\u2013570 (1996)","DOI":"10.1145\/237814.238004"},{"key":"11_CR16","volume-title":"Quantum Computation and Quantum Information","author":"MA Nielsen","year":"2000","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, New York (2000)"},{"issue":"1","key":"11_CR17","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/S0304-3975(02)00377-8","volume":"287","author":"R de Wolf","year":"2002","unstructured":"de Wolf, R.: Quantum communication and complexity. Theor. Comput. Sci. 287(1), 337\u2013353 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Yao, A.C-C.: Some complexity questions related to distributed computing. In: Proceedings of the 11th Symposium on Theory of Computing, pp. 209\u2013213 (1979)","DOI":"10.1145\/800135.804414"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2015"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48054-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T23:07:55Z","timestamp":1748560075000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-48054-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662480533","9783662480540"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48054-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"11 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}