Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

APPROX

2007

Springer

2007

Springer

Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to ﬁnd a polynomial-time samplable distribution (e.g., the uniform distribution) and a language in NTIME(f(n)) for some polynomial function f, such that the language is hard on the average with respect to this distribution, given that NP is worst-case hard (i.e. NP = P, or NP ⊆ BPP). Currently, no such result is known even if we relax the language to be in nondeterministic sub-exponential time. There has been a long line of research trying to explain our failure in proving such worst-case/average-case connections [FF93,Vio03,BT03,AGGM06]. The bottom line of this research is essentially that (under plausible assumptions) non-adaptive Turing reductions cannot prove such results. In this paper we revisit the problem. Our ﬁrst observation is that the above mentioned negative arguments extend to a non-standard notion of average-case complexity, in which the distribution on the inputs with res...

Related Content

Added |
07 Jun 2010 |

Updated |
07 Jun 2010 |

Type |
Conference |

Year |
2007 |

Where |
APPROX |

Authors |
Dan Gutfreund, Amnon Ta-Shma |

Comments (0)