幂的有限幂:多项式恒等式检验和持久式的深度4下界
The Limited Power of Powering: Polynomial Identity Testing and a Depth-four Lower Bound for the Permanent
摘要:
多项式恒等式检验和算术电路下界是代数复杂性理论中的两个核心问题。有趣的是,这些问题实际上是相关的。本文的作者之一最近提出了一个“真正的τ-猜想”,这是受这种联系的启发。实τ-猜想指出稀疏一元多项式的乘积之和的实根的个数应该是多项式有界的。它意味着计算永久多项式的算术电路的大小的超多项式下界。本文证明了实τ-猜想对一类有限的稀疏多项式乘积和成立。这一结果产生了一个限制类的深度-4电路的下界:我们表明,多项式大小的电路从这个类不能计算永久的,我们也给出了一个确定性的多项式身份测试算法为同一类电路。
英文摘要:
Polynomial identity testing and arithmetic circuit lower bounds are two central questions in algebraic complexity theory. It is an intriguing fact that these questions are actually related. One of the authors of the present paper has recently proposed a "real τ-conjecture" which is inspired by this connection. The real τ-conjecture states that the number of real roots of a sum of products of sparse univariate polynomials should be polynomially bounded. It implies a superpolynomial lower bound on the size of arithmetic circuits computing the permanent polynomial. In this paper we show that the real τ-conjecture holds true for a restricted class of sums of products of sparse polynomials. This result yields lower bounds for a restricted class of depth-4 circuits: we show that polynomial size circuits from this class cannot compute the permanent, and we also give a deterministic polynomial identity testing algorithm for the same class of circuits.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。