首页> 外文期刊>Electronic Colloquium on Computational Complexity >A Derandomized Switching Lemma and an Improved Derandomization of AC0
【24h】

A Derandomized Switching Lemma and an Improved Derandomization of AC0

机译:去随机交换引理和改进的AC0去随机

获取原文
           

摘要

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.
机译:我们描述了一种新的AC0伪随机发生器。我们的生成器欺骗深度为d且大小为M的电路,并使用长度为O(logd + 4M)的种子。以前d3的最佳构造是由于Nisan,并且种子长度为O(log2d + 6M)。给定Nisan型发生器和当前电路下限状态,种子长度为O(log2d +(1)M)最好。 ;给定电路下限的当前状态,种子长度(logdM)是任何伪随机数发生器构造的障碍。对于d = 2,已知种子长度为O(log2M)的伪随机生成器。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号