Andrew Drucker. Improved Direct Product Theorems for Randomized Query Complexity. In Proceedings of the 26th Annual IEEE Conference on Computational Complexity, CCC 2011, San Jose, California, June 8-10, 2011. pages 1-11, IEEE Computer Society, 2011. [doi]
@inproceedings{Drucker11-2,
title = {Improved Direct Product Theorems for Randomized Query Complexity},
author = {Andrew Drucker},
year = {2011},
doi = {10.1109/CCC.2011.29},
url = {http://dx.doi.org/10.1109/CCC.2011.29},
researchr = {https://researchr.org/publication/Drucker11-2},
cites = {0},
citedby = {0},
pages = {1-11},
booktitle = {Proceedings of the 26th Annual IEEE Conference on Computational Complexity, CCC 2011, San Jose, California, June 8-10, 2011},
publisher = {IEEE Computer Society},
}