2 search results - page 1 / 1 » Uniform Hardness Amplification in NP via Monotone Codes |
ECCC
2006
13 years 4 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
2002
ACM
14 years 5 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...