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

关于小宽度代数分支程序

On algebraic branching programs of small width

Karl Bringmann, Christian Ikenmeyer, Jeroen Zuiddam

摘要:

1979年Valiant证明了公式规模为多项式有界的族的复杂性类VP_e包含在代数分支程序(ABP)规模为多项式有界的族的复杂性类VP_s中。受分离这些类的问题的启发,我们研究了拓扑闭包VP_e-bar,即可以由VP_e中的多项式任意逼近的多项式类。我们用一个非常简单的完全多项式(特征不同于2)来描述VP_e-bar,它的递归定义类似于Fibonacci数。进一步理解这个多项式似乎是一个有前途的路线,新的公式下限。我们的方法是植根于小恒定宽度的ABPs的研究。在1992年Ben-Or和Cleve证明了公式的大小多项式等价于宽度为3的ABP大小。我们扩展了他们的结果(特征不同于2),表明近似公式的大小是多项式等价于近似宽度-2 ABP大小。这是令人惊讶的,因为在2011年Allender和Wang给出了显式多项式,这些多项式根本不能用宽度为2的ABP计算!我们构造的细节导致了VP_e-bar的上述特征。作为这项工作的一个自然的延续,我们证明了类VNP可以被描述为一类的家庭,承认多项式有界的维数超过多项式许多仿射线性形式的产品的超立方总和。这给出了代数复杂性类与它们的非确定性类似物的第一个分离。

英文摘要:

In 1979 Valiant showed that the complexity class VP_e of families with polynomially bounded formula size is contained in the class VP_s of families that have algebraic branching programs (ABPs) of polynomially bounded size. Motivated by the problem of separating these classes we study the topological closure VP_e-bar, i.e. the class of polynomials that can be approximated arbitrarily closely by polynomials in VP_e. We describe VP_e-bar with a strikingly simple complete polynomial (in characteristic different from 2) whose recursive definition is similar to the Fibonacci numbers. Further understanding this polynomial seems to be a promising route to new formula lower bounds. Our methods are rooted in the study of ABPs of small constant width. In 1992 Ben-Or and Cleve showed that formula size is polynomially equivalent to width-3 ABP size. We extend their result (in characteristic different from 2) by showing that approximate formula size is polynomially equivalent to approximate width-2 ABP size. This is surprising because in 2011 Allender and Wang gave explicit polynomials that cannot be computed by width-2 ABPs at all! The details of our construction lead to the aforementioned characterization of VP_e-bar. As a natural continuation of this work we prove that the class VNP can be described as the class of families that admit a hypercube summation of polynomially bounded dimension over a product of polynomially many affine linear forms. This gives the first separations of algebraic complexity classes from their nondeterministic analogs.

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

↑