Improved Direct Product Theorems for Randomized Query Complexity

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]

Possibly Related Publications

The following publications are possibly variants of this publication: