{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:22:07Z","timestamp":1759638127108,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,5,17]],"date-time":"2008-05-17T00:00:00Z","timestamp":1210982400000},"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":[[2008,5,17]]},"DOI":"10.1145\/1374376.1374392","type":"proceedings-article","created":{"date-parts":[[2008,5,28]],"date-time":"2008-05-28T16:50:20Z","timestamp":1211993420000},"page":"85-94","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["The pattern matrix method for lower bounds on quantum communication"],"prefix":"10.1145","author":[{"given":"Alexander A.","family":"Sherstov","sequence":"first","affiliation":[{"name":"The University of Texas at Austin, Austin, TX, USA"}]}],"member":"320","published-online":{"date-parts":[[2008,5,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008731.1008735"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979935476"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502097"},{"key":"e_1_3_2_1_4_1","first-page":"120","volume-title":"CCC","author":"Buhrman H.","year":"2001","unstructured":"H. Buhrman and R. de Wolf . Communication complexity lower bounds by polynomials . In CCC , pages 120 -- 130 , 2001 . H. Buhrman and R. de Wolf. Communication complexity lower bounds by polynomials. In CCC, pages 120--130, 2001."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2007.18"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.24"},{"key":"e_1_3_2_1_7_1","volume-title":"Electronic Colloquium on Computational Complexity (ECCC)","author":"Chattopadhyay A.","year":"2008","unstructured":"A. Chattopadhyay and A. Ada . Multiparty communication complexity of disjointness . In Electronic Colloquium on Computational Complexity (ECCC) , January 2008 . Report TR08-002. A. Chattopadhyay and A. Ada. Multiparty communication complexity of disjointness. In Electronic Colloquium on Computational Complexity (ECCC), January 2008. Report TR08-002."},{"key":"e_1_3_2_1_8_1","volume-title":"Electronic Colloquium on Computational Complexity (ECCC)","author":"David M.","year":"2008","unstructured":"M. David and T. Pitassi . Separating NOF communication complexity classes RP and NP . In Electronic Colloquium on Computational Complexity (ECCC) , February 2008 . Report TR08-014. M. David and T. Pitassi. Separating NOF communication complexity classes RP and NP. In Electronic Colloquium on Computational Complexity (ECCC), February 2008. Report TR08-014."},{"key":"e_1_3_2_1_9_1","volume-title":"October","author":"de Wolf R.","year":"2007","unstructured":"R. de Wolf . Personal communication , October 2007 . R. de Wolf. Personal communication, October 2007."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02888-9"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2006.39"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/5509"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/646516.696149"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1070\/RM1968v023n06ABEH001251"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875559"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380786"},{"key":"e_1_3_2_1_17_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_1_18_1","volume-title":"Communication complexity","author":"Kushilevitz E.","year":"1997","unstructured":"E. Kushilevitz and N. Nisan . Communication complexity . Cambridge University Press , New York , 1997 . E. Kushilevitz and N. Nisan. Communication complexity. Cambridge University Press, New York, 1997."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2008.29"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2008.25"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250892"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2008.28"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/50066"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129758"},{"issue":"1","key":"e_1_3_2_1_25_1","first-page":"145","article-title":"Quantum communication complexity of symmetric predicates. Izvestiya","volume":"67","author":"Razborov A. A.","year":"2003","unstructured":"A. A. Razborov . Quantum communication complexity of symmetric predicates. Izvestiya : Mathematics , 67 ( 1 ): 145 -- 159 , 2003 . A. A. Razborov. Quantum communication complexity of symmetric predicates. Izvestiya: Mathematics, 67(1):145--159, 2003.","journal-title":"Mathematics"},{"key":"e_1_3_2_1_26_1","volume-title":"June","author":"Razborov A. A.","year":"2007","unstructured":"A. A. Razborov . Personal communication , June 2007 . A. A. Razborov. Personal communication, June 2007."},{"key":"e_1_3_2_1_27_1","volume-title":"An Introduction to the Approximation of Functions","author":"Rivlin T. J.","year":"1981","unstructured":"T. J. Rivlin . An Introduction to the Approximation of Functions . Dover Publications , New York , 1981 . T. J. Rivlin. An Introduction to the Approximation of Functions. Dover Publications, New York, 1981."},{"key":"e_1_3_2_1_28_1","volume-title":"Theory of linear and integer programming","author":"Schrijver A.","year":"1998","unstructured":"A. Schrijver . Theory of linear and integer programming . John Wiley & amp; Sons, Inc., New York, 1998 . A. Schrijver. Theory of linear and integer programming. John Wiley & Sons, Inc., New York, 1998."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250834"},{"key":"e_1_3_2_1_30_1","volume-title":"Quantum communication complexity of block-composed functions. Available at arXiv:0710.0095v1","author":"Shi Y.","year":"2007","unstructured":"Y. Shi and Y. Zhu . Quantum communication complexity of block-composed functions. Available at arXiv:0710.0095v1 , 29 September 2007 . Y. Shi and Y. Zhu. Quantum communication complexity of block-composed functions. Available at arXiv:0710.0095v1, 29 September 2007."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1993.366852"}],"event":{"name":"STOC '08: Symposium on Theory of Computing","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Victoria British Columbia Canada","acronym":"STOC '08"},"container-title":["Proceedings of the fortieth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1374376.1374392","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1374376.1374392","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:32Z","timestamp":1750278152000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1374376.1374392"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5,17]]},"references-count":31,"alternative-id":["10.1145\/1374376.1374392","10.1145\/1374376"],"URL":"https:\/\/doi.org\/10.1145\/1374376.1374392","relation":{},"subject":[],"published":{"date-parts":[[2008,5,17]]},"assertion":[{"value":"2008-05-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}