arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1604.08121cs.CC
收藏

关于${AC}^0$的多项式逼近

On Polynomial Approximations to ${AC}^0$

Prahladh Harsha, Srikanth Srinivasan

摘要:

本文在${\rm AC}^0$的多项式逼近的有关问题上取得了进展。这是已知的,由工程樽井(理论计算。sci. 1993)和Beigel、Reingold和Spielman(Proc.$6$ th CCC,1991),任何大小为$s$和深度为$d$的${\rm AC}^0$电路在次数为$(\log (s/\varepsilon))^{O(d)}$的实数上具有$\varepsilon$-错误概率多项式。我们将这个上界改进为$(\log s)^{O(d)}\cdot \log(1/\varepsilon)$,这对于$\varepsilon$的小值要好得多。我们通过使用它来解决Tal(ECCC 2014)提出的问题,给出了这个结果的应用:我们证明了$(\log s)^{O(d)}\cdot \log(1/\varepsilon)$-明智的独立性愚弄了${\rm AC}^0$,改进了Tal对布雷弗曼定理(J. ACM,2010)的加强,即$(\log (s/\varepsilon))^{O(d)}$-明智的独立性愚弄了${\rm AC}^0$。直到$O(d)$中隐含的常数,我们的结果是紧的。据我们所知,这是${\rm AC}^0$的第一个PRG构造,它实现了对错误$\varepsilon$的最佳依赖。我们还证明了最佳多项式逼近${\rm AC}^0$的下界。我们表明,任何多项式逼近${\rm OR}$功能的$n$位一个小的恒定误差必须有程度至少$\widetildeΩ(\sqrt{\log n})$。这一结果在Meka,Nguyen和Vu最近证明的下限上呈指数级改善(arXiv 2015)。

英文摘要:

We make progress on some questions related to polynomial approximations of ${\rm AC}^0$. It is known, by works of Tarui (Theoret. Comput. Sci. 1993) and Beigel, Reingold, and Spielman (Proc. $6$th CCC, 1991), that any ${\rm AC}^0$ circuit of size $s$ and depth $d$ has an $\varepsilon$-error probabilistic polynomial over the reals of degree $(\log (s/\varepsilon))^{O(d)}$. We improve this upper bound to $(\log s)^{O(d)}\cdot \log(1/\varepsilon)$, which is much better for small values of $\varepsilon$. We give an application of this result by using it to resolve a question posed by Tal (ECCC 2014): we show that $(\log s)^{O(d)}\cdot \log(1/\varepsilon)$-wise independence fools ${\rm AC}^0$, improving on Tal's strengthening of Braverman's theorem (J. ACM, 2010) that $(\log (s/\varepsilon))^{O(d)}$-wise independence fools ${\rm AC}^0$. Up to the constant implicit in the $O(d)$, our result is tight. As far as we know, this is the first PRG construction for ${\rm AC}^0$ that achieves optimal dependence on the error $\varepsilon$. We also prove lower bounds on the best polynomial approximations to ${\rm AC}^0$. We show that any polynomial approximating the ${\rm OR}$ function on $n$ bits to a small constant error must have degree at least $\widetildeΩ(\sqrt{\log n})$. This result improves exponentially on a recent lower bound demonstrated by Meka, Nguyen, and Vu (arXiv 2015).

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑