32 search results - page 3 / 7 » Chernoff-Type Direct Product Theorems |
APPROX
2010
Springer
13 years 6 months 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 ...
MFPS
1991
13 years 8 months ago
1991
The problem of decomposing domains into sensible factors is addressed and solved for the case of dI-domains. A decomposition theorem is proved which allows the represention of a l...
TCC
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. We consider weakly-verifiable puzzles which are challengeresponse puzzles such that the responder may not be able to verify for itself whether it answered the challenge ...
STOC
2006
ACM
14 years 5 months ago
2006
ACM
CC
2008
Springer
13 years 5 months ago
2008
Springer
We prove a version of the derandomized Direct Product lemma for deterministic space-bounded algorithms. Suppose a Boolean function g : {0, 1}n {0, 1} cannot be computed on more th...