论文信息 - The Trade-Off Between the Additive Complexity and the Asynchronicity of Linear and Bilinear Algorithms

The Trade-Off Between the Additive Complexity and the Asynchronicity of Linear and Bilinear Algorithms

Abstract It is shown that every linear algorithm that computes a set of Q linearly independent linear forms in k variables must involve at least Q log2 k - H additions and subtractions where H is a quantity that measures the asynchronicity of the algorithm. The result is extended to the evaluation of a set of bilinear forms.

Victor Y. Pan

[1] Don Coppersmith,et al. On the Asymptotic Complexity of Matrix Multiplication , 1982, SIAM J. Comput..

[2] Jacques Morgenstern,et al. Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform , 1973, JACM.

[3] S. Winograd. On the multiplicative complexity of the Discrete Fourier Transform , 1979 .

[4] John E. Savage,et al. Lower Bounds on Synchronous Combinational Complexity , 1979, SIAM J. Comput..

[5] Allan Borodin,et al. The computational complexity of algebraic and numeric problems , 1975, Elsevier computer science library.

[6] Leslie G. Valiant,et al. Graph-Theoretic Properties in computational Complexity , 1976, J. Comput. Syst. Sci..

[7] Victor Y. Pan. The Additive and Logical Complexities of Linear and Bilinear Arithmetic Algorithms , 1983, J. Algorithms.