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

线性阈值电路的量化去随机化

Quantified Derandomization of Linear Threshold Circuits

Roei Tell

摘要:

当前复杂性理论中的一个突出挑战是试图证明$TC^0$的下界,$TC^0$是一类具有多数门的常数深度、多项式大小的电路。依赖于Williams(2013)的结果,证明这样的下界的吸引人的方法是构造$TC^0$的非平凡去随机化算法。在这项工作中,我们向后一个目标迈出了第一步,证明了第一个积极的成果,关于深度$d>2$的$TC^0$电路的去随机化。我们的第一个主要结果是一个量化的去随机算法的$TC^0$电路的超线性数量的电线。具体来说,我们构建了一个算法,得到作为输入的$TC^0$电路$C$在$n$输入位与深度$d$和$n^{1+\exp(-d)}$线,运行在几乎多项式时间,并区分$C$拒绝最多$2^{n^{1-1/5d}}$输入的情况下,$C$接受最多$2^{n^{1-1/5d}}$输入的情况。事实上,即使当电路$C$是线性阈值电路而不仅仅是$TC^0$电路(即,$C$是具有线性阈值门的电路,其比多数门强)。我们的第二个主要结果是,即使是适度的改进,我们的量化去随机化算法将产生一个非平凡的算法,所有的$TC^0$的标准去随机化,并因此意味着$NEXP\not\subseteq TC^0$。具体地,如果存在量化的去随机化算法,其得到具有深度$d$和$n^{1+O(1/d)}$导线的$TC^0$电路作为输入(而不是$n^{1+\exp(-d)}$线),在最多$2^{n^{\exp(-d)}}$时运行,并且在$C$拒绝最多$2^{n^{1-1/5d}}$输入的情况和$C$接受最多$2^{n^{1-1/5d}}$输入的情况之间进行区分,则存在用于$TC^0$的标准去随机化的具有运行时间$2^{n^{1-Ω(1)}}$的算法。

英文摘要:

One of the prominent current challenges in complexity theory is the attempt to prove lower bounds for $TC^0$, the class of constant-depth, polynomial-size circuits with majority gates. Relying on the results of Williams (2013), an appealing approach to prove such lower bounds is to construct a non-trivial derandomization algorithm for $TC^0$. In this work we take a first step towards the latter goal, by proving the first positive results regarding the derandomization of $TC^0$ circuits of depth $d>2$. Our first main result is a quantified derandomization algorithm for $TC^0$ circuits with a super-linear number of wires. Specifically, we construct an algorithm that gets as input a $TC^0$ circuit $C$ over $n$ input bits with depth $d$ and $n^{1+\exp(-d)}$ wires, runs in almost-polynomial-time, and distinguishes between the case that $C$ rejects at most $2^{n^{1-1/5d}}$ inputs and the case that $C$ accepts at most $2^{n^{1-1/5d}}$ inputs. In fact, our algorithm works even when the circuit $C$ is a linear threshold circuit, rather than just a $TC^0$ circuit (i.e., $C$ is a circuit with linear threshold gates, which are stronger than majority gates). Our second main result is that even a modest improvement of our quantified derandomization algorithm would yield a non-trivial algorithm for standard derandomization of all of $TC^0$, and would consequently imply that $NEXP\not\subseteq TC^0$. Specifically, if there exists a quantified derandomization algorithm that gets as input a $TC^0$ circuit with depth $d$ and $n^{1+O(1/d)}$ wires (rather than $n^{1+\exp(-d)}$ wires), runs in time at most $2^{n^{\exp(-d)}}$, and distinguishes between the case that $C$ rejects at most $2^{n^{1-1/5d}}$ inputs and the case that $C$ accepts at most $2^{n^{1-1/5d}}$ inputs, then there exists an algorithm with running time $2^{n^{1-Ω(1)}}$ for standard derandomization of $TC^0$.

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

↑