{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T05:14:37Z","timestamp":1740028477133,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540240587"},{"type":"electronic","value":"9783540305385"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30538-5_32","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:40:30Z","timestamp":1268401230000},"page":"384-395","source":"Crossref","is-referenced-by-count":6,"title":["Quantum and Classical Communication-Space Tradeoffs from Rectangle Bounds"],"prefix":"10.1007","author":[{"given":"Hartmut","family":"Klauck","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"Aaronson, S.: Limitations of Quantum Advice and One-Way Communication. In: Proceedings of 19th IEEE Conference on Computational Complexity, pp. 320\u2013332, quant-ph\/0402095 (2004)","DOI":"10.1109\/CCC.2004.1313854"},{"key":"32_CR2","unstructured":"Aaronson, S., Ambainis, A.: Quantum search of spatial regions. In: Proceedings of 44th IEEE FOCS, pp. 200\u2013209, quant-ph\/0303041 (2003)"},{"issue":"4","key":"32_CR3","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/s004930100009","volume":"21","author":"L. Babai","year":"2001","unstructured":"Babai, L., Hayes, T., Kimmel, P.: The Cost of the Missing Bit: Communication Complexity with Help. Combinatorica\u00a021(4), 455\u2013488 (2001); Earlier version in STOC 1998","journal-title":"Combinatorica"},{"issue":"2","key":"32_CR4","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1137\/0220017","volume":"20","author":"P. Beame","year":"1991","unstructured":"Beame, P.: A general sequential time-space tradeoff for finding unique elements. SIAM Journal on Computing\u00a020(2), 270\u2013277 (1991); Earlier version in STOC 1989","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"32_CR5","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1137\/S0097539791196883","volume":"23","author":"P. Beame","year":"1994","unstructured":"Beame, P., Tompa, M., Yan, P.: Communication-space tradeoffs for unrestricted protocols. SIAM Journal on Computing\u00a023(3), 652\u2013661 (1994); Earlier version in FOCS 1990","journal-title":"SIAM Journal on Computing"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Buhrman, H., Cleve, R., Wigderson, A.: Quantum vs. classical communication and computation. In: 30th ACM Symposium on Theory of Computing, pp. 63\u201368, quant-ph\/9802040 (1998)","DOI":"10.1145\/276698.276713"},{"key":"32_CR7","unstructured":"Buhrman, H., \u0160palek, R.: Quantum Verification of Matrix Products. quant-ph\/0409035"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"Cobham, A.: The Recognition Problem for the Set of Perfect Squares. In: Conference Record of the Seventh Annual Symposium on Switching and Automata Theory FOCS, pp. 78\u201387 (1966)","DOI":"10.1109\/SWAT.1966.30"},{"issue":"3","key":"32_CR9","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"Coppersmith, D., Winograd, S.: Matrix Multiplication via Arithmetic Progressions. J.\u00a0Symb.\u00a0Comput.\u00a09(3), 251\u2013280 (1990)","journal-title":"J.\u00a0Symb.\u00a0Comput."},{"key":"32_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/3-540-45841-7_24","volume-title":"STACS 2002","author":"P. H\u00f8yer","year":"2002","unstructured":"H\u00f8yer, P., de Wolf, R.: Improved quantum communication complexity bounds for disjointness and equality. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol.\u00a02285, pp. 299\u2013310. Springer, Heidelberg (2002) quant-ph\/0109068"},{"issue":"4","key":"32_CR11","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1137\/0405044","volume":"5","author":"B. Kalyanasundaram","year":"1992","unstructured":"Kalyanasundaram, B., Schnitger, G.: The probabilistic communication complexity of set intersection. SIAM Journal on Discrete Mathematics\u00a05(4), 545\u2013557 (1992); Earlier version in Structures 1987","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"32_CR12","doi-asserted-by":"crossref","unstructured":"Klauck, H.: Lower Bounds for Quantum Communication Complexity. In: 42nd IEEE FOCS, pp. 288\u2013297 (2001) quant-ph\/0106160","DOI":"10.1109\/SFCS.2001.959903"},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"Klauck, H.: Quantum time-space tradeoffs for sorting. In: Proceedings of 35th ACM STOC, pp. 69\u201376 (2003) quant-ph\/0211174","DOI":"10.1145\/780542.780553"},{"key":"32_CR14","unstructured":"Klauck, H.: Rectangle Size Bounds and Threshold Covers in Communication Complexity. In: Proceedings of 18th IEEE Conference on Computational Complexity, pp. 118\u2013134 (2003) cs.CC\/0208006"},{"key":"32_CR15","unstructured":"Klauck, H., de Wolf, R., \u0160palek, R.: Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs. To appear in 45th IEEE FOCS(2004) quant-ph\/0402123"},{"key":"32_CR16","volume-title":"Communication Complexity","author":"E. Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)"},{"key":"32_CR17","unstructured":"Kremer, I.: Quantum communication. Master\u2019s thesis, Hebrew University, Computer Science Department (1995)"},{"issue":"3","key":"32_CR18","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1016\/0022-0000(92)90028-H","volume":"45","author":"T.W. Lam","year":"1992","unstructured":"Lam, T.W., Tiwari, P., Tompa, M.: Trade-offs between communication and space. Journal of Computer and Systems Sciences\u00a045(3), 296\u2013315 (1992); Earlier version in STOC 1989","journal-title":"Journal of Computer and Systems Sciences"},{"issue":"1","key":"32_CR19","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0304-3975(93)90257-T","volume":"107","author":"Y. Mansour","year":"1993","unstructured":"Mansour, Y., Nisan, N., Tiwari, P.: The Computational Complexity of Universal Hashing. Theoretical Computer Science\u00a0107(1), 121\u2013133 (1993);Earlier version in STOC\u201990.","journal-title":"Theoretical Computer Science"},{"key":"32_CR20","volume-title":"Quantum Computation and Quantum Information","author":"M.A. Nielsen","year":"2000","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)"},{"key":"32_CR21","doi-asserted-by":"crossref","unstructured":"Pagter, J., Rauhe, T.: Optimal Time-Space Trade-Offs for Sorting. In: Proceedings of 39th IEEE FOCS, pp. 264\u2013268 (1998)","DOI":"10.1109\/SFCS.1998.743455"},{"key":"32_CR22","doi-asserted-by":"crossref","unstructured":"Parnafes, I., Raz, R., Wigderson, A.: Direct product results and the GCD problem, in old and new communication models. In: Proceedings of 29th ACM STOC, pp. 363\u2013372 (1997)","DOI":"10.1145\/258533.258620"},{"issue":"2","key":"32_CR23","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/0304-3975(92)90260-M","volume":"106","author":"A.A. Razborov","year":"1992","unstructured":"Razborov, A.A.: On the distributional complexity of disjointness. Theoretical Computer Science\u00a0106(2), 385\u2013390 (1992)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"32_CR24","first-page":"159","volume":"67","author":"A.A. Razborov","year":"2003","unstructured":"Razborov, A.A.: Quantum communication complexity of symmetric predicates. Izvestiya of the Russian Academy of Science, Mathematics\u00a067(1), 159\u2013176 (2003) quant-ph\/0204025","journal-title":"Izvestiya of the Russian Academy of Science, Mathematics"},{"key":"32_CR25","doi-asserted-by":"crossref","unstructured":"Shaltiel, R.: Towards proving strong direct product theorems. In: Proceedings of 16th IEEE Conference on Computational Complexity, pp. 107\u2013119 (2001)","DOI":"10.1109\/CCC.2001.933878"},{"key":"32_CR26","unstructured":"Yao, A.C.-C.: Quantum circuit complexity. In: Proceedings of 34th IEEE FOCS, pp. 352\u2013360 (1993)"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30538-5_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T12:12:01Z","timestamp":1739967121000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30538-5_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540240587","9783540305385"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30538-5_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}