arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1312.0355cs.CC
收藏

小距离连接的公式与电路

Formulas vs. Circuits for Small Distance Connectivity

Benjamin Rossman

摘要:

我们给出了有界深度布尔公式与电路的幂的第一个超多项式分离。具体来说,我们考虑的问题距离$k(n)$连接,它要求是否两个指定的节点在一个图的大小$n$连接的路径长度最多$k(n)$。这个问题在深度为$O(\log k)$、大小为$O(kn^3)$的{ \bf电路}上是可解的(通过递归加倍技术)。与此相反,我们表明,解决这个问题的{ \bf公式}的深度$\log n/(\log\log n)^{O(1)}$需要的大小$n^{Ω(\log k)}$的所有$k(n) \leq \log\log n$。作为推论:(i)由此得出,用于距离$k(n)$连接性的多项式大小电路需要用于所有$k(n) \leq \log\log n$的深度$Ω(\log k)$。这与递归加倍的上限相匹配,并改进了Beame、Pitassi和Impagliazzo [BIP 98]之前的$Ω(\log\log k)$下限。(ii)对于所有$s(n) = n^{O(1)}$和$d(n) \leq \log\log\log n$,我们得到了一个$s^{Ω(d)}$的严格下界,它是通过深度- $d$公式来模拟大小- $s$深度- $d$电路所需的大小.对于任何$d(n) \nleq O(1)$,先前已知没有比$s^{Ω(1)}$更好的下限。我们的证明技术是集中在一个新的概念,路径集的复杂性,粗略地说,措施的最低成本构建一组(部分)路径在一个宇宙的大小$n$通过工会和关系连接的操作,受到一定的密度约束。我们的一半证明表明,解决距离$k(n)$连通性的有界深度公式意味着路径集复杂性的上限。另一半是路径集复杂性的组合下界。

英文摘要:

We give the first super-polynomial separation in the power of bounded-depth boolean formulas vs. circuits. Specifically, we consider the problem Distance $k(n)$ Connectivity, which asks whether two specified nodes in a graph of size $n$ are connected by a path of length at most $k(n)$. This problem is solvable (by the recursive doubling technique) on {\bf circuits} of depth $O(\log k)$ and size $O(kn^3)$. In contrast, we show that solving this problem on {\bf formulas} of depth $\log n/(\log\log n)^{O(1)}$ requires size $n^{Ω(\log k)}$ for all $k(n) \leq \log\log n$. As corollaries: (i) It follows that polynomial-size circuits for Distance $k(n)$ Connectivity require depth $Ω(\log k)$ for all $k(n) \leq \log\log n$. This matches the upper bound from recursive doubling and improves a previous $Ω(\log\log k)$ lower bound of Beame, Pitassi and Impagliazzo [BIP98]. (ii) We get a tight lower bound of $s^{Ω(d)}$ on the size required to simulate size-$s$ depth-$d$ circuits by depth-$d$ formulas for all $s(n) = n^{O(1)}$ and $d(n) \leq \log\log\log n$. No lower bound better than $s^{Ω(1)}$ was previously known for any $d(n) \nleq O(1)$. Our proof technique is centered on a new notion of pathset complexity, which roughly speaking measures the minimum cost of constructing a set of (partial) paths in a universe of size $n$ via the operations of union and relational join, subject to certain density constraints. Half of our proof shows that bounded-depth formulas solving Distance $k(n)$ Connectivity imply upper bounds on pathset complexity. The other half is a combinatorial lower bound on pathset complexity.

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

↑