Sciweavers

SIAMCOMP
2010
88views more  SIAMCOMP 2010»
12 years 11 months ago
Hardness Amplification Proofs Require Majority
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...
Ronen Shaltiel, Emanuele Viola
STOC
2004
ACM
86views Algorithms» more  STOC 2004»
14 years 5 months ago
Using nondeterminism to amplify hardness
We revisit the problem of hardness amplification in NP, as recently studied by O'Donnell (STOC `02). We prove that if NP has a balanced function f such that any circuit of si...
Alexander Healy, Salil P. Vadhan, Emanuele Viola