arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1401.2444cs.CCcs.DS
收藏

线性阈值门电路的新算法和下界

New algorithms and lower bounds for circuits with linear threshold gates

Ryan Williams

摘要:

令$ACC \circ THR$为一类恒定深度电路,由AND、OR和MOD $m$门(对于某些恒定$m > 1$)组成,底层门计算任意线性阈值函数。这类电路可以被看作是$ACC$(我们知道非平凡下限)和深度2线性阈值电路(非平凡下限保持开放)之间的“中点”。我们给出了一个算法来评估一个任意对称函数的$2^{n^{o(1)}}$ $ACC \circ THR$电路的大小$2^{n^{o(1)}}$,在所有可能的输入,在$2^n \cdot poly(n)$时间。由此产生若干后果:$\bullet$对次指数大小的$ACC \circ THR$电路的满意分配的数量可以在$2^{n-n^{\varepsilon}}$时间内计算(其中$\varepsilon > 0$取决于电路的深度和模数)。$\bullet$ $NEXP$没有准多项式大小的$ACC \circ THR$电路,$NEXP$也没有准多项式大小的$ACC \circ SYM$电路。甚至对于$AND \circ OR \circ THR$电路,也不知道非平凡的大小下限。$\bullet$每一个带有$n$布尔变量和$s$线性约束的0 - 1整数线性规划都有很高的概率在$2^{n-Ω(n/((\log M)(\log s)^{5}))}\cdot poly(s,n,M)$时间内可解,其中$M$上限限制了系数的位复杂度。(For例如,具有$[-2^{poly(n)},2^{poly(n)}]$和$poly(n)$约束的权重的0 - 1整数规划可以在$2^{n-Ω(n/\log^6 n)}$时间内求解。)我们还提出了一种算法,用于评估深度为2的线性阈值电路(又名,$THR \circ THR$),在$2^n \cdot poly(n)$时间内运行。这证明了$THR \circ THR$的非均匀下限是可以达到的。

英文摘要:

Let $ACC \circ THR$ be the class of constant-depth circuits comprised of AND, OR, and MOD$m$ gates (for some constant $m > 1$), with a bottom layer of gates computing arbitrary linear threshold functions. This class of circuits can be seen as a "midpoint" between $ACC$ (where we know nontrivial lower bounds) and depth-two linear threshold circuits (where nontrivial lower bounds remain open). We give an algorithm for evaluating an arbitrary symmetric function of $2^{n^{o(1)}}$ $ACC \circ THR$ circuits of size $2^{n^{o(1)}}$, on all possible inputs, in $2^n \cdot poly(n)$ time. Several consequences are derived: $\bullet$ The number of satisfying assignments to an $ACC \circ THR$ circuit of subexponential size can be computed in $2^{n-n^{\varepsilon}}$ time (where $\varepsilon > 0$ depends on the depth and modulus of the circuit). $\bullet$ $NEXP$ does not have quasi-polynomial size $ACC \circ THR$ circuits, nor does $NEXP$ have quasi-polynomial size $ACC \circ SYM$ circuits. Nontrivial size lower bounds were not known even for $AND \circ OR \circ THR$ circuits. $\bullet$ Every 0-1 integer linear program with $n$ Boolean variables and $s$ linear constraints is solvable in $2^{n-Ω(n/((\log M)(\log s)^{5}))}\cdot poly(s,n,M)$ time with high probability, where $M$ upper bounds the bit complexity of the coefficients. (For example, 0-1 integer programs with weights in $[-2^{poly(n)},2^{poly(n)}]$ and $poly(n)$ constraints can be solved in $2^{n-Ω(n/\log^6 n)}$ time.) We also present an algorithm for evaluating depth-two linear threshold circuits (a.k.a., $THR \circ THR$) with exponential weights and $2^{n/24}$ size on all $2^n$ input assignments, running in $2^n \cdot poly(n)$ time. This is evidence that non-uniform lower bounds for $THR \circ THR$ are within reach.

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

↑