4 search results - page 1 / 1 » Hardness Amplification via Space-Efficient Direct Products |
85
Voted
CC
2008
Springer
14 years 9 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...
74
Voted
ECCC
2006
14 years 9 months ago
2006
We consider the problem of amplifying uniform average-case hardness of languages in NP, where hardness is with respect to BPP algorithms. We introduce the notion of monotone error...
64
Voted
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
91
Voted
STOC
2009
ACM
15 years 10 months ago
2009
ACM
The "direct product code" of a function f gives its values on all k-tuples (f(x1), . . . , f(xk)). This basic construct underlies "hardness amplification" in c...