{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:37:37Z","timestamp":1775054257419,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642141645","type":"print"},{"value":"9783642141652","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14165-2_41","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T13:26:02Z","timestamp":1278336362000},"page":"475-489","source":"Crossref","is-referenced-by-count":8,"title":["Composition Theorems in Communication Complexity"],"prefix":"10.1007","author":[{"given":"Troy","family":"Lee","sequence":"first","affiliation":[]},{"given":"Shengyu","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"41_CR1","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1145\/502090.502097","volume":"48","author":"R. Beals","year":"2001","unstructured":"Beals, R., Buhrman, H., Cleve, R., Mosca, M., de Wolf, R.: Quantum lower bounds by polynomials. Journal of the ACM\u00a048(4), 778\u2013797 (2001); Earlier version in FOCS 1998","journal-title":"Journal of the ACM"},{"key":"41_CR2","doi-asserted-by":"crossref","unstructured":"Buhrman, H., Cleve, R., Wigderson, A.: Quantum vs. classical communication and computation. In: Proceedings of the 30th ACM Symposium on the Theory of Computing, pp. 63\u201368 (1998)","DOI":"10.1145\/276698.276713"},{"key":"41_CR3","doi-asserted-by":"crossref","unstructured":"Beame, P., Huynh-Ngoc, D.: Multiparty communication complexity and threshold circuit size of AC0. In: Proceedings of the 50th IEEE Symposium on Foundations of Computer Science, pp. 53\u201362 (2009)","DOI":"10.1109\/FOCS.2009.12"},{"key":"41_CR4","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/0022-0000(92)90047-M","volume":"45","author":"L. Babai","year":"1992","unstructured":"Babai, L., Nisan, N., Szegedy, M.: Multiparty protocols, pseudorandom generators for Logspace, and time-space trade-offs. Journal of Computer and System Sciences\u00a045, 204\u2013232 (1992)","journal-title":"Journal of Computer and System Sciences"},{"key":"41_CR5","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0304-3975(01)00144-X","volume":"288","author":"H. Buhrman","year":"2002","unstructured":"Buhrman, H., de Wolf, R.: Complexity measures and decision tree complexity: A survey. Theoretical Computer Science\u00a0288, 21\u201343 (2002)","journal-title":"Theoretical Computer Science"},{"key":"41_CR6","unstructured":"Chattopadhyay, A., Ada, A.: Multiparty communication complexity of disjointness. Technical Report TR-08-002, ECCC (2008)"},{"key":"41_CR7","doi-asserted-by":"crossref","unstructured":"Chattopadhyay, A.: Discrepancy and the power of bottom fan-in depth-three circuits. In: Proceedings of the 48th IEEE Symposium on Foundations of Computer Science, pp. 449\u2013458 (2007)","DOI":"10.1109\/FOCS.2007.30"},{"key":"41_CR8","unstructured":"Chattopadhyay, A.: Circuits, Communication, and Polynomials, PhD thesis, McGill University (2008)"},{"key":"41_CR9","volume-title":"Communication Complexity","author":"E. Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)"},{"issue":"4","key":"41_CR10","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/s00493-007-2160-5","volume":"27","author":"N. Linial","year":"2007","unstructured":"Linial, N., Mendelson, S., Schechtman, G., Shraibman, A.: Complexity measures of sign matrices. Combinatorica\u00a027(4), 439\u2013463 (2007)","journal-title":"Combinatorica"},{"key":"41_CR11","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L., Saks, M.: M\u00f6bius functions and communication complexity. In: Proceedings of the 29th IEEE Symposium on Foundations of Computer Science, pp. 81\u201390 (1988)","DOI":"10.1109\/SFCS.1988.21924"},{"issue":"2","key":"41_CR12","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/s00037-009-0276-2","volume":"18","author":"T. Lee","year":"2009","unstructured":"Lee, T., Shraibman, A.: Disjointness is hard in the multiparty number-on-the-forehead model. Computational Complexity\u00a018(2), 309\u2013336 (2009)","journal-title":"Computational Complexity"},{"key":"41_CR13","doi-asserted-by":"crossref","unstructured":"Lee, T., Shraibman, A.: Lower bounds in communication complexity. Foundations and Trends in Theoretical Computer Science\u00a03 (2009)","DOI":"10.1561\/0400000040"},{"key":"41_CR14","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1017\/S0963548308009656","volume":"18","author":"N. Linial","year":"2009","unstructured":"Linial, N., Shraibman, A.: Learning complexity versus communication complexity. Combinatorics, Probability, and Computing\u00a018, 227\u2013245 (2009)","journal-title":"Combinatorics, Probability, and Computing"},{"key":"41_CR15","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1002\/rsa.20232","volume":"34","author":"N. Linial","year":"2009","unstructured":"Linial, N., Shraibman, A.: Lower bounds in communication complexity based on factorization norms. Random Structures and Algorithms\u00a034, 368\u2013394 (2009)","journal-title":"Random Structures and Algorithms"},{"key":"41_CR16","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1109\/CCC.2008.25","volume-title":"Proceedings of the 23rd IEEE Conference on Computational Complexity","author":"T. Lee","year":"2008","unstructured":"Lee, T., Shraibman, A., \u0160palek, R.: A direct product theorem for discrepancy. In: Proceedings of the 23rd IEEE Conference on Computational Complexity, pp. 71\u201380. IEEE, Los Alamitos (2008)"},{"key":"41_CR17","doi-asserted-by":"crossref","unstructured":"Nisan, N.: The communication complexity of threshold gates. In: Proceedings of Combinatorics, Paul Erdos is Eighty, pp. 301\u2013315 (1994)","DOI":"10.1007\/BF01263419"},{"key":"41_CR18","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF01263419","volume":"4","author":"N. Nisan","year":"1994","unstructured":"Nisan, N., Szegedy, M.: On the degree of Boolean functions as real polynomials. Computational Complexity\u00a04, 301\u2013313 (1994)","journal-title":"Computational Complexity"},{"key":"41_CR19","doi-asserted-by":"crossref","unstructured":"Raz, R.: Exponential separation of quantum and classical communication complexity. In: Proceedings of the 31st ACM Symposium on the Theory of Computing, pp. 358\u2013367 (1999)","DOI":"10.1145\/301250.301343"},{"issue":"1","key":"41_CR20","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1070\/IM2003v067n01ABEH000422","volume":"67","author":"A. Razborov","year":"2003","unstructured":"Razborov, A.: Quantum communication complexity of symmetric predicates. Izvestiya: Mathematics\u00a067(1), 145\u2013159 (2003)","journal-title":"Izvestiya: Mathematics"},{"key":"41_CR21","doi-asserted-by":"crossref","unstructured":"Razborov, A., Sherstov, A.: The sign rank of AC0. In: Proceedings of the 49th IEEE Symposium on Foundations of Computer Science, pp. 57\u201366 (2008)","DOI":"10.1109\/FOCS.2008.19"},{"issue":"1-2","key":"41_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00037-003-0175-x","volume":"12","author":"R. Shaltiel","year":"2003","unstructured":"Shaltiel, R.: Towards proving strong direct product theorems. Computational Complexity\u00a012(1-2), 1\u201322 (2003)","journal-title":"Computational Complexity"},{"key":"41_CR23","first-page":"294","volume-title":"Proceedings of the 39th ACM Symposium on the Theory of Computing","author":"A. Sherstov","year":"2007","unstructured":"Sherstov, A.: Separating AC0 from depth-2 majority circuits. In: Proceedings of the 39th ACM Symposium on the Theory of Computing, pp. 294\u2013301. ACM, New York (2007)"},{"key":"41_CR24","first-page":"59","volume":"95","author":"A. Sherstov","year":"2008","unstructured":"Sherstov, A.: Communication lower bounds using dual polynomials. Bulletin of the EATCS\u00a095, 59\u201393 (2008)","journal-title":"Bulletin of the EATCS"},{"key":"41_CR25","doi-asserted-by":"crossref","unstructured":"Sherstov, A.: The unbounded-error communication complexity of symmetric functions. In: Proceedings of the 49th IEEE Symposium on Foundations of Computer Science (2008)","DOI":"10.1109\/FOCS.2008.20"},{"key":"41_CR26","unstructured":"Sherstov, A.: The pattern matrix method. SIAM Journal on Computing (2009)"},{"issue":"5-6","key":"41_CR27","doi-asserted-by":"crossref","first-page":"435","DOI":"10.26421\/QIC10.5-6-5","volume":"10","author":"A. Sherstov","year":"2010","unstructured":"Sherstov, A.: On quantum-classical equivalence for composed communication problems. Quantum Information and Computation\u00a010(5-6), 435\u2013455 (2010)","journal-title":"Quantum Information and Computation"},{"issue":"3-4","key":"41_CR28","first-page":"255","volume":"9","author":"Y. Shi","year":"2009","unstructured":"Shi, Y., Zhang, Z.: Communication complexities of XOR functions. Quantum information and computation\u00a09(3-4), 255\u2013263 (2009)","journal-title":"Quantum information and computation"},{"issue":"5,6","key":"41_CR29","doi-asserted-by":"crossref","first-page":"444","DOI":"10.26421\/QIC9.5-6-7","volume":"9","author":"Y. Shi","year":"2009","unstructured":"Shi, Y., Zhu, Y.: Quantum communication complexity of block-composed functions. Quantum information and computation\u00a09(5,6), 444\u2013460 (2009)","journal-title":"Quantum information and computation"},{"key":"41_CR30","doi-asserted-by":"crossref","unstructured":"Yao, A.: Some complexity questions related to distributive computing. In: Proceedings of the 11th ACM Symposium on the Theory of Computing, pp. 209\u2013213 (1979)","DOI":"10.1145\/800135.804414"},{"key":"41_CR31","doi-asserted-by":"crossref","unstructured":"Zhang, S.: On the tightness of the Buhrman-Cleve-Wigderson simulation. In: Proceedings of the 20th International Symposium on Algorithms and Computation, pp. 434\u2013440 (2009)","DOI":"10.1007\/978-3-642-10631-6_45"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14165-2_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,30]],"date-time":"2021-10-30T19:30:12Z","timestamp":1635622212000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14165-2_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141645","9783642141652"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14165-2_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}