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

COCO

2003

Springer

2003

Springer

We study the complexity of building pseudorandom generators (PRGs) with logarithmic seed length from hard functions. We show that, starting from a function f : {0, 1}l → {0, 1} that is mildly hard on average, i.e. every circuit of size 2Ω(l) fails to compute f on at least a 1/poly(l) fraction of inputs, we can build a PRG : {0, 1}O(log n) → {0, 1}n computable in ATIME(O(1), log n) = alternating time O(log n) with O(1) alternations. Such a PRG implies BP · AC0 = AC0 under DLOGTIME-uniformity. On the negative side, we prove a tight lower bound on black-box PRG constructions that are based on worst-case hard functions. We also prove a tight lower bound on blackbox worst-case hardness ampliﬁcation, which is the problem of producing an average-case hard function starting from a worst-case hard one. These lower bounds are obtained by showing that constant depth circuits cannot compute extractors and list-decodable codes.

Related Content

Added |
06 Jul 2010 |

Updated |
06 Jul 2010 |

Type |
Conference |

Year |
2003 |

Where |
COCO |

Authors |
Emanuele Viola |

Comments (0)