On the power of algebraic branching programs of width two

On the power of algebraic branching programs of width two
复制标题

论宽度为 2 的代数分支程序的威力

DOI:
10.1007/s00037-015-0114-7
复制
发表时间:
2011
影响因子:
1.4
通讯作者:
Fengming Wang
Fengming Wang
中科院分区:
计算机科学3区
文献类型:
--
作者:
Eric Allender;Fengming Wang

文献摘要

参考文献

被引文献

相似文献

我们表明,有家庭的多项式具有小深度的算术电路,不能表示的代数分支程序的宽度为2。这阐明了计算一系列二乘二矩阵的乘积的问题的复杂性,该问题在多种设置中出现。
We show that there are families of polynomials having small depth-two arithmetic circuits that cannot be expressed by algebraic branching programs of width two. This clarifies the complexity of the problem of computing the product of a sequence of two-by-two matrices, which arises in several settings.
DOI: 10.1016/j.jcss.2007.07.005
发表时间: 2008-09
期刊: J. Comput. Syst. Sci.
影响因子: --
作者:
Jeremy T. Bradley;S. Gilmore;J. Hillston
通讯作者: Jeremy T. Bradley;S. Gilmore;J. Hillston