{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T15:20:20Z","timestamp":1764688820778,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":49,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T00:00:00Z","timestamp":1307318400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,6,6]]},"DOI":"10.1145\/1993636.1993643","type":"proceedings-article","created":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T11:53:52Z","timestamp":1307361232000},"page":"41-50","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["Strong direct product theorems for quantum communication and query complexity"],"prefix":"10.1145","author":[{"given":"Alexander A.","family":"Sherstov","sequence":"first","affiliation":[{"name":"Microsoft Research, Cambridge, MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2011,6,6]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2005.v001a001"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008731.1008735"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2002.1826"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-007-9022-9"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2003.11.006"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806701"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502097"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-007-0220-2"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796302531"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.45"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796493"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-006-1313-z"},{"key":"e_1_3_2_2_13_1","first-page":"120","volume-title":"Proc. of the 16th Conf. on Computational Complexity (CCC)","author":"Buhrman H.","year":"2001","unstructured":"H. Buhrman and R. de Wolf . Communication complexity lower bounds by polynomials . In Proc. of the 16th Conf. on Computational Complexity (CCC) , pages 120 -- 130 , 2001 . H. Buhrman and R. de Wolf. Communication complexity lower bounds by polynomials. In Proc. of the 16th Conf. on Computational Complexity (CCC), pages 120--130, 2001."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875561"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-008-0250-4"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2011.29"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792235864"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502098"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2009.28"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374462"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/1759210.1759242"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2005.24"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01206317"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30538-5_32"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702405620"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806702"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/05063235X"},{"key":"e_1_3_2_2_28_1","volume-title":"Quantum communication. Master's thesis","author":"Kremer I.","year":"1995","unstructured":"I. Kremer . Quantum communication. Master's thesis , Hebrew University, Computer Science Department , 1995 . I. Kremer. Quantum communication. Master's thesis, Hebrew University, Computer Science Department, 1995."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/264772"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/1803907"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2008.25"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-007-2160-5"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.v34:3"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795282444"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258620"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795280895"},{"key":"e_1_3_2_2_37_1","first-page":"145","article-title":"Quantum communication complexity of symmetric predicates. Izvestiya of the Russian Academy of Sciences","volume":"67","author":"Razborov A. A.","year":"2002","unstructured":"A. A. Razborov . Quantum communication complexity of symmetric predicates. Izvestiya of the Russian Academy of Sciences , Mathematics , 67 : 145 -- 159 , 2002 . A. A. Razborov. Quantum communication complexity of symmetric predicates. Izvestiya of the Russian Academy of Sciences, Mathematics, 67:145--159, 2002.","journal-title":"Mathematics"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-003-0175-x"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2008.18"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1137\/080733644"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993643"},{"key":"e_1_3_2_2_42_1","first-page":"59","article-title":"Communication lower bounds using dual polynomials","volume":"95","author":"Sherstov A. A.","year":"2008","unstructured":"A. A. Sherstov . Communication lower bounds using dual polynomials . Bulletin of the EATCS , 95 : 59 -- 93 , 2008 . A. A. Sherstov. Communication lower bounds using dual polynomials. Bulletin of the EATCS, 95:59--93, 2008.","journal-title":"Bulletin of the EATCS"},{"key":"e_1_3_2_2_43_1","volume-title":"Quantum communication complexity of block-composed functions. Quantum Information & Computation, 9(5--6):444--460","author":"Shi Y.","year":"2009","unstructured":"Y. Shi and Y. Zhu . Quantum communication complexity of block-composed functions. Quantum Information & Computation, 9(5--6):444--460 , 2009 . Y. Shi and Y. Zhu. Quantum communication complexity of block-composed functions. Quantum Information & Computation, 9(5--6):444--460, 2009."},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2008.9"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2008.v004a007"},{"key":"e_1_3_2_2_46_1","volume-title":"University of Amsterdam","author":"de Wolf R.","year":"2001","unstructured":"R. de Wolf . Quantum Computing and Communication Complexity. PhD thesis , University of Amsterdam , 2001 . R. de Wolf. Quantum Computing and Communication Complexity. PhD thesis, University of Amsterdam, 2001."},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.5555\/2016985.2016989"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.95"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1993.366852"}],"event":{"name":"STOC'11: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"San Jose California USA","acronym":"STOC'11"},"container-title":["Proceedings of the forty-third annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993636.1993643","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1993636.1993643","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:00:05Z","timestamp":1750244405000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993636.1993643"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,6]]},"references-count":49,"alternative-id":["10.1145\/1993636.1993643","10.1145\/1993636"],"URL":"https:\/\/doi.org\/10.1145\/1993636.1993643","relation":{},"subject":[],"published":{"date-parts":[[2011,6,6]]},"assertion":[{"value":"2011-06-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}