22 search results - page 1 / 5 » On uniform amplification of hardness in NP |
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...
STOC
2005
ACM
14 years 11 months ago
2005
ACM
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...
COCO
2008
Springer
14 years 19 days ago
2008
Springer
We study the average-case hardness of the class NP against deterministic polynomial time algorithms. We prove that there exists some constant
STOC
2002
ACM
14 years 11 months ago
2002
ACM
We study the average-case hardness of the class NP against deterministic polynomial time algorithms. We prove that there exists some constant ? > 0 such that if there is some l...
STOC
2004
ACM
14 years 11 months ago
2004
ACM
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...