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

低通信叶门的de Morgan公式的算法和下界

Algorithms and Lower Bounds for de Morgan Formulas of Low-Communication Leaf Gates

Valentine Kabanets, Sajin Koroth, Zhenjian Lu, Dimitrios Myrisiotis, Igor Oliveira

摘要:

类$FORMULA[s] \circ \mathcal{G}$由布尔函数组成,该布尔函数可通过大小- $s$ de Morgan公式计算,该公式的叶子是来自类$\mathcal{G}$的任何布尔函数。我们给下界和(SAT,学习和PRG)算法$FORMULA[n^{1.99}]\circ \mathcal{G}$,类$\mathcal{G}$的功能,低通信复杂性。令$R^{(k)}(\mathcal{G})$是$\mathcal{G}$的最大$k$方NOF随机化通信复杂度。我们展示:(1)对于$$ s = o \! \left ( \frac{n^2}{ \left(k \cdot 4^k \cdot {R}^{(k)}(\mathcal{G}) \cdot \log (n/\varepsilon) \cdot \log(1/\varepsilon) \right)^{2}} \right).$$,在$FORMULA[s]\circ \mathcal{G}$中不能在大于$1/2+\varepsilon$的输入分数上计算广义内积函数$GIP^k_n$。作为推论,我们得到了$GIP^k_n$相对于$FORMULA[n^{1.99}]\circ PTF^{k-1}$的平均情况下的下界。(2)有一个种子长度为$n/2 + O\left(\sqrt{s} \cdot R^{(2)}(\mathcal{G}) \cdot\log(s/\varepsilon) \cdot \log (1/\varepsilon) \right)$的PRG,$\varepsilon$ -欺骗$FORMULA[s] \circ \mathcal{G}$。对于$FORMULA[s] \circ LTF$,我们得到了较好的种子长度$O\left(n^{1/2}\cdot s^{1/4}\cdot \log(n)\cdot \log(n/\varepsilon)\right)$。这给出了第一个非平凡的PRG(种子长度$o(n)$)的$n$半空间的交叉点的制度,其中$\varepsilon \leq 1/n$。(3)存在用于$FORMULA[s] \circ \mathcal{G}$的随机化$2^{n-t}$时间PDMATHABNFSAT算法,其中$$t=Ω\left(\frac{n}{\sqrt{s}\cdot\log^2(s)\cdot R^{(2)}(\mathcal{G})}\right)^{1/2}.$$特别地,这意味着用于$FORMULA[n^{1.99}]\circ LTF$的非平凡#SAT算法. (4)$FORMULA[n^{1.99}]\circ XOR$中没有最小电路尺寸问题。在算法方面,我们表明,$FORMULA[n^{1.99}] \circ XOR$可以PAC学习时间$2^{O(n/\log n)}$。

英文摘要:

The class $FORMULA[s] \circ \mathcal{G}$ consists of Boolean functions computable by size-$s$ de Morgan formulas whose leaves are any Boolean functions from a class $\mathcal{G}$. We give lower bounds and (SAT, Learning, and PRG) algorithms for $FORMULA[n^{1.99}]\circ \mathcal{G}$, for classes $\mathcal{G}$ of functions with low communication complexity. Let $R^{(k)}(\mathcal{G})$ be the maximum $k$-party NOF randomized communication complexity of $\mathcal{G}$. We show: (1) The Generalized Inner Product function $GIP^k_n$ cannot be computed in $FORMULA[s]\circ \mathcal{G}$ on more than $1/2+\varepsilon$ fraction of inputs for $$ s = o \! \left ( \frac{n^2}{ \left(k \cdot 4^k \cdot {R}^{(k)}(\mathcal{G}) \cdot \log (n/\varepsilon) \cdot \log(1/\varepsilon) \right)^{2}} \right).$$ As a corollary, we get an average-case lower bound for $GIP^k_n$ against $FORMULA[n^{1.99}]\circ PTF^{k-1}$. (2) There is a PRG of seed length $n/2 + O\left(\sqrt{s} \cdot R^{(2)}(\mathcal{G}) \cdot\log(s/\varepsilon) \cdot \log (1/\varepsilon) \right)$ that $\varepsilon$-fools $FORMULA[s] \circ \mathcal{G}$. For $FORMULA[s] \circ LTF$, we get the better seed length $O\left(n^{1/2}\cdot s^{1/4}\cdot \log(n)\cdot \log(n/\varepsilon)\right)$. This gives the first non-trivial PRG (with seed length $o(n)$) for intersections of $n$ half-spaces in the regime where $\varepsilon \leq 1/n$. (3) There is a randomized $2^{n-t}$-time $\#$SAT algorithm for $FORMULA[s] \circ \mathcal{G}$, where $$t=Ω\left(\frac{n}{\sqrt{s}\cdot\log^2(s)\cdot R^{(2)}(\mathcal{G})}\right)^{1/2}.$$ In particular, this implies a nontrivial #SAT algorithm for $FORMULA[n^{1.99}]\circ LTF$. (4) The Minimum Circuit Size Problem is not in $FORMULA[n^{1.99}]\circ XOR$. On the algorithmic side, we show that $FORMULA[n^{1.99}] \circ XOR$ can be PAC-learned in time $2^{O(n/\log n)}$.

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

↑