17 search results - page 1 / 4 » Improved Direct Product Theorems for Randomized Query Comple... |
CORR
2010
Springer
13 years 11 months ago
2010
Springer
CORR
2010
Springer
13 years 9 months ago
2010
Springer
A strong direct product theorem (SDPT) states that solving n instances of a problem requires ˝.n/ times the resources for a single instance, even to achieve success probability 2 ...
COCO
2008
Springer
14 years 20 days ago
2008
Springer
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
SIAMCOMP
2010
13 years 9 months ago
2010
The classical direct product theorem for circuits says that if a Boolean function f : {0, 1}n → {0, 1} is somewhat hard to compute on average by small circuits, then the correspo...
APPROX
2010
Springer
14 years 13 days ago
2010
Springer
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...