Sciweavers

27 search results - page 1 / 6
» Extractors Using Hardness Amplification
Sort
View
APPROX
2009
Springer
107views Algorithms» more  APPROX 2009»
13 years 8 months ago
Extractors Using Hardness Amplification
Anindya De, Luca Trevisan
STOC
2004
ACM
86views Algorithms» more  STOC 2004»
14 years 4 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
ECCC
2010
80views more  ECCC 2010»
13 years 4 months ago
Query Complexity in Errorless Hardness Amplification
An errorless circuit for a boolean function is one that outputs the correct answer or "don't know" on each input (and never outputs the wrong answer). The goal of e...
Thomas Watson
ECCC
2010
124views more  ECCC 2010»
13 years 4 months ago
Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas
Much work has been done on learning various classes of "simple" monotone functions under the uniform distribution. In this paper we give the first unconditional lower bo...
Vitaly Feldman, Homin K. Lee, Rocco A. Servedio
FAST
2008
13 years 6 months ago
Portably Solving File TOCTTOU Races with Hardness Amplification
The file-system API of contemporary systems makes programs vulnerable to TOCTTOU (time of check to time of use) race conditions. Existing solutions either help users to detect the...
Dan Tsafrir, Tomer Hertz, David Wagner, Dilma Da S...