{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:36:25Z","timestamp":1755999385919,"version":"3.28.0"},"reference-count":38,"publisher":"IEEE Computer. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/sfcs.2003.1238196","type":"proceedings-article","created":{"date-parts":[[2004,3,1]],"date-time":"2004-03-01T21:26:50Z","timestamp":1078176410000},"page":"220-229","source":"Crossref","is-referenced-by-count":23,"title":["A lower bound for the bounded round quantum communication complexity of set disjointness"],"prefix":"10.1109","author":[{"given":"R.","family":"Jain","sequence":"first","affiliation":[]},{"given":"J.","family":"Radhakrishnan","sequence":"additional","affiliation":[]},{"family":"Sen P","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892082"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2003.1214411"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892124"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509963"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45841-7_24"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90260-M"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/18.761271"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1070\/IM2003v067n01ABEH000422"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509966"},{"key":"13","first-page":"678","article-title":"Ecole d'Ete? de Probabilite?s de Saint-Flour VII","author":"dacunha-castelle","year":"1978","journal-title":"Lecture Notes in Mathematics"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539799361701"},{"key":"37","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804414"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959901"},{"key":"38","first-page":"352","article-title":"Quantum circuit complexity","author":"yao","year":"1993","journal-title":"Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science"},{"key":"12","first-page":"61","article-title":"Quantum entanglement and the communication complexity of the inner product function","volume":"1509","author":"cleve","year":"1998","journal-title":"Proceedings of the 1st NASA International Conference on Quantum Computing and Quantum Communications Lecture Notes in Computer Science"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480192238482"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780640"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959903"},{"journal-title":"Communication Complexity","year":"1997","author":"kushilevitz","key":"23"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380786"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023316"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1137\/0405044"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1109\/18.61115"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1145\/800076.802482"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1998.1577"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1545"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276708"},{"key":"10","article-title":"Near-optimal lower bounds on the multiparty communication complexity of set-disjointness","author":"chakrabarti","year":"0","journal-title":"Proceedings of the 18th Annual IEEE Conference on Computational Complexity 2003"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238194"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814608"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2002.1004344"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.15"},{"key":"32","doi-asserted-by":"crossref","first-page":"868","DOI":"10.1007\/3-540-45465-9_74","article-title":"The communication complexity of approximate set packing and covering","volume":"2380","author":"nisan","year":"2002","journal-title":"Proceedings of the 29th International Colloquium on Automata Languages and Programming Lecture Notes in Computer Science"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2001.933879"},{"journal-title":"Quantum Computation and Quantum Information","year":"2000","author":"nielsen","key":"31"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276713"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1137\/0217015"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181944"}],"event":{"name":"44th Annual IEEE Symposium on Foundations of Computer Science - FOCS 2003","acronym":"SFCS-03","location":"Cambridge, MA, USA"},"container-title":["44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8767\/27770\/01238196.pdf?arnumber=1238196","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T00:05:26Z","timestamp":1497571526000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1238196\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/sfcs.2003.1238196","relation":{},"subject":[]}}