SOME EXACT COMPLEXITY RESULTS FOR STRAIGHT-LINE COMPUTATIONS OVER SEMIRINGS
SOME EXACT COMPLEXITY RESULTS FOR STRAIGHT-LINE COMPUTATIONS OVER SEMIRINGS
复制标题
DOI：
10.1145/322326.322341
复制
发表时间：
1982-01-01
影响因子：
2.5
通讯作者：
SNIR, M
中科院分区：
文献类型：
--
作者：
JERRUM, M;SNIR, M
本文考虑了在某些有限域上计算多项式的问题。本文给出了计算迭代矩阵乘法、迭代卷积和积和等函数的直链算法所需乘法次数的精确界。利用这些界，证明了分支的使用可以指数地加快min、+运算的计算速度。减法可以指数地加速算术计算。这些结果可以被解释为否认快速”普适”的存在。计算某些多项式的算法
The problem of computing polynomials in certain semmngs is considered. Precise bounds are obtained on the number of multiplications required by straight-hne algorithms which compute such functions as iterated matrix multiplication, iterated convolution, and permanent Usmg these bounds, tt is shown that the use of branching can exponentially speed up computations using the min,+ operations, and that subtraction can exponentially speed up arithmetic computations These results can be interpreted as denying the existence of fast" universal" algorithms for computing certain polynomials