7 search results - page 1 / 2 » Hardness Amplification Proofs Require Majority |
SIAMCOMP
2010
13 years 5 months ago
2010
Hardness amplification is the fundamental task of converting a -hard function f : {0, 1}n {0, 1} into a (1/2 - )-hard function Amp(f), where f is -hard if small circuits fail to c...
STOC
2010
ACM
14 years 8 months ago
2010
ACM
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
TCC
2009
Springer
14 years 11 months ago
2009
Springer
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
ECCC
2006
13 years 11 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...
ICFEM
2009
Springer
14 years 5 months ago
2009
Springer
Coinductive proofs of behavioral equivalence often require human ingenuity, in that one is expected to provide a “good” relation extending one’s goal with additional lemmas, ...