{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:00:37Z","timestamp":1761292837683,"version":"3.28.0"},"reference-count":28,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1109\/ccc.2011.29","type":"proceedings-article","created":{"date-parts":[[2011,7,27]],"date-time":"2011-07-27T13:41:28Z","timestamp":1311774088000},"page":"1-11","source":"Crossref","is-referenced-by-count":5,"title":["Improved Direct Product Theorems for Randomized Query Complexity"],"prefix":"10.1109","author":[{"given":"Andrew","family":"Drucker","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2008.25"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2008.v004a007"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795282444"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73038"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00144-X"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-007-9022-9"},{"key":"ref16","first-page":"237","article-title":"The multiplicative quantum adversary","author":"spalek","year":"2008","journal-title":"IEEE Conference on Computational Complexity"},{"key":"ref17","article-title":"Strong direct product theorems for quantum communication and query complexity","volume":"abs 1011 4935","author":"sherstov","year":"2010","journal-title":"CoRR STOC '11"},{"key":"ref18","article-title":"Symmetry-assisted adversaries for quantum state generation","author":"ambainis","year":"2010","journal-title":"arxiv 1012 2112 [quant-ph]"},{"key":"ref19","article-title":"A strong direct product theorem for disjointness","volume":"abs 908 2940","author":"klauck","year":"2009","journal-title":"CoRR"},{"key":"ref4","first-page":"617","article-title":"Constructive proofs of concentration bounds","author":"impagliazzo","year":"2010","journal-title":"RANDOM"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.44"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.62"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100230"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258590"},{"key":"ref5","article-title":"On Yao's XOR-lemma","volume":"2","author":"goldreich","year":"1995","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/SCT.1994.315814"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/080734030"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-003-0175-x"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2010.07.020"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/05063235X"},{"key":"ref20","article-title":"Strong direct product conjecture holds for all relations in public coin randomized one-way communication complexity","volume":"abs 1010 522","author":"jain","year":"2010","journal-title":"CoRR"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492584"},{"key":"ref21","article-title":"A strong direct product theorem for two-way public coin communication complexity","volume":"abs 1010 846","author":"jain","year":"2010","journal-title":"CoRR"},{"key":"ref24","article-title":"General hardness amplification of predicates and puzzles","volume":"abs 1002 3534","author":"holenstein","year":"2010","journal-title":"CoRR in TCC '11"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060689"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31856-9_49"},{"key":"ref25","first-page":"222","article-title":"Probabilistic computations: Toward a unified measure of complexity (extended abstract)","author":"yao","year":"1977","journal-title":"FOCS"}],"event":{"name":"2011 IEEE Annual Conference on Computational Complexity (CCC)","start":{"date-parts":[[2011,6,8]]},"location":"San Jose, CA, USA","end":{"date-parts":[[2011,6,11]]}},"container-title":["2011 IEEE 26th Annual Conference on Computational Complexity"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5959244\/5959800\/05959816.pdf?arnumber=5959816","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T11:52:39Z","timestamp":1490097159000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5959816\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/ccc.2011.29","relation":{},"subject":[],"published":{"date-parts":[[2011,6]]}}}