An improved derandomization of the switching lemma
An improved derandomization of the switching lemma
复制标题
改进的切换引理去随机化
DOI:
10.1145/3406325.3451054
复制
发表时间:
2021
期刊:
影响因子:
--
通讯作者:
Kelley, Zander
中科院分区:
文献类型:
--
作者:
Kelley, Zander
We prove a new derandomization of Håstad’s switching lemma, showing how to efficiently generate restrictions satisfying the switching lemma for DNF or CNF formulas of sizemusing onlyO(logm) random bits. Derandomizations of the switching lemma have been useful in many works as a key building-block for constructing objects which are in some way provably-pseudorandom with respect to AC0-circuits.Here, we use our new derandomization to give an improved analysis of the pseudorandom generator of Trevisan and Xue for AC0-circuits (CCC’13): we show that the generator ε-fools size-m, depth-Dcircuits withn-bit inputs using onlyO(log(m/ε)D· logn) random bits. In particular, we obtain (modulo the loglog-factors hidden in theO-notation) a dependence onm/ε which is best-possible with respect to currently-known AC0-circuit lower bounds.
登录
查看更多内容
DOI:
10.1145/3357713.3384241
发表时间:
2020
期刊:
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (STOC 2020
影响因子:
--
作者:
Lovett, Shachar;Wu, Kewen;Zhang, Jiapeng
通讯作者:
Zhang, Jiapeng
DOI:
--
发表时间:
2013
期刊:
2013 IEEE Conference on Computational Complexity
影响因子:
--
作者:
L. Trevisan;Tongke Xue
通讯作者:
Tongke Xue
影响因子:
3.3
作者:
Denise R. McLane
通讯作者:
Denise R. McLane
影响因子:
1.4
作者:
R. Tell
通讯作者:
R. Tell
DOI:
--
发表时间:
2010
期刊:
International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
影响因子:
--
作者:
Anindya De;Omid Etesami;Luca Trevisan;Madhur Tulsiani
通讯作者:
Madhur Tulsiani