首页    期刊浏览 2025年02月20日 星期四
登录注册

文章基本信息

  • 标题:A Derandomized Switching Lemma and an Improved Derandomization of AC0
  • 本地全文:下载
  • 作者:Luca Trevisan
  • 期刊名称:Electronic Colloquium on Computational Complexity
  • 印刷版ISSN:1433-8092
  • 出版年度:2012
  • 卷号:2012
  • 出版社:Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
  • 摘要:

    We describe a new pseudorandom generator for AC0. Our generator -fools circuits of depth d and size M and uses a seed of length O(logd+4M) . The previous best construction for d3 was due to Nisan, and had seed length O(log2d+6M) .A seed length of O(log2d+(1)M) is best possible given Nisan-type generators and the current state of circuit lower bounds; Seed length (logdM) is a barrier for any pseudorandom generator construction given the current state of circuit lower bounds. For d=2, a pseudorandom generator of seed length O(log2M) was known.

国家哲学社会科学文献中心版权所有