Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > RANDOM SELF REDUCTIONS:
Reports tagged with Random Self Reductions:
TR05-015 | 27th January 2005
Andrej Bogdanov, Luca Trevisan

On Worst-Case to Average-Case Reductions for NP Problems

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 collapses to the third level. Feigenbaum and
Fortnow (SICOMP 22:994-1005, 1993) show the same conclusion
under the stronger assumption that an
more >>>




ISSN 1433-8092 | Imprint