11 search results - page 1 / 3 » On Worst-Case to Average-Case Reductions for NP Problems |
FOCS
2003
IEEE
14 years 4 months ago
2003
IEEE
We show that if an NP-complete problem has a non-adaptive self-corrector with respect to a samplable distribution then coNP is contained in NP/poly and the polynomial hierarchy co...
STACS
2010
Springer
14 years 5 months ago
2010
Springer
This paper presents the following results on sets that are complete for NP. (i) If there is a problem in NP that requires 2nΩ(1) time at almost all lengths, then every many-one N...
APPROX
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
FOCS
2004
IEEE
14 years 2 months ago
2004
IEEE
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
APPROX
2010
Springer
14 years 13 days ago
2010
Springer
We prove that relative to an oracle, there is no worst-case to average-case reduction for NP. We also handle classes that are somewhat larger than NP, as well as worst-case to err...