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

代数公式的最优深度约简

Towards Optimal Depth-Reductions for Algebraic Formulas

Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan, Sébastien Tavenas

摘要:

Brent,Kuck and Maruyama(IEEE Trans. Computers 1973)和Brent(JACM 1974)的经典结果表明,任何大小为s的代数公式都可以转化为深度为O(log s)的代数公式,而只需要一个多项式爆破。在本文中,我们考虑一个细粒度的版本,这个结果取决于代数公式计算的多项式的程度。给定一个大小为s的齐次代数公式计算一个次数为d的多项式P,我们证明了P也可以由深度为O(log d)和大小为poly(s)的(无界扇入)代数公式计算。我们的证明表明,这一结果也保持在高度限制的设置单调,非交换代数公式。这改进了当d较小时(即,d<<s)。特别是,对于d=O(log s)的设置,以及Raz的结果(STOC 2010,JACM 2013),我们的结果意味着即使对于非齐次公式也有相同的深度减少。鉴于最近的代数公式下限,这是特别有趣的,它正好在这个“低程度”和“低深度”的设置工作。我们还表明,这些结果不能改善单调设置,即使是交换公式。

英文摘要:

Classical results of Brent, Kuck and Maruyama (IEEE Trans. Computers 1973) and Brent (JACM 1974) show that any algebraic formula of size s can be converted to one of depth O(log s) with only a polynomial blow-up in size. In this paper, we consider a fine-grained version of this result depending on the degree of the polynomial computed by the algebraic formula. Given a homogeneous algebraic formula of size s computing a polynomial P of degree d, we show that P can also be computed by an (unbounded fan-in) algebraic formula of depth O(log d) and size poly(s). Our proof shows that this result also holds in the highly restricted setting of monotone, non-commutative algebraic formulas. This improves on previous results in the regime when d is small (i.e., d<<s). In particular, for the setting of d=O(log s), along with a result of Raz (STOC 2010, JACM 2013), our result implies the same depth reduction even for inhomogeneous formulas. This is particularly interesting in light of recent algebraic formula lower bounds, which work precisely in this ``low-degree" and ``low-depth" setting. We also show that these results cannot be improved in the monotone setting, even for commutative formulas.

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

↑