A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
On worst-case to average-case reductions for NP problems

*
44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.
*

We show that if an NP-complete problem has a non-adaptive self-corrector with respect to any 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(SICOMP 22:994- , 1993 show the same conclusion under the stronger assumption that an NP-complete problem has a non-adaptive random self-reduction. A self-corrector for a language L with respect to a distribution D is a worst-case to averagecase

doi:10.1109/sfcs.2003.1238205
dblp:conf/focs/BogdanovT03
fatcat:uc7vlkohbndm3pe4gqey425gvu