Sciweavers

1450 search results - page 2 / 290
» On the Complexity of Hardness Amplification
Sort
View
STOC
2005
ACM
145views Algorithms» more  STOC 2005»
14 years 5 months ago
On uniform amplification of hardness in NP
We continue the study of amplification of average-case complexity within NP, and we focus on the uniform case. We prove that if every problem in NP admits an efficient uniform alg...
Luca Trevisan
IJON
2000
73views more  IJON 2000»
13 years 5 months ago
A recurrent network model for the phase invariance of complex cell responses
Cortical amplification is a mechanism for modifying the selectivity of neurons through recurrent interactions. Although conventionally used to enhance selectivity, cortical amplif...
Frances S. Chance, Sacha B. Nelson, L. F. Abbott
FOCS
1999
IEEE
13 years 9 months ago
Boosting and Hard-Core Sets
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
Adam Klivans, Rocco A. Servedio
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
ECCC
2006
116views more  ECCC 2006»
13 years 5 months ago
Uniform Hardness Amplification in NP via Monotone Codes
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...
Joshua Buresh-Oppenheim, Valentine Kabanets, Rahul...