The trade-off between the additive complexity and the asynchronicity of linear and bilinear algorithms
Author:
- Victor Ya. PanVPVictor Ya. Pan
- 1 January 1986
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 22 (1) , 11-14
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- The additive and logical complexities of linear and bilinear arithmetic algorithmsJournal of Algorithms, 1983
- On the Asymptotic Complexity of Matrix MultiplicationSIAM Journal on Computing, 1982
- Lower Bounds on Synchronous Combinational ComplexitySIAM Journal on Computing, 1979
- On the multiplicative complexity of the Discrete Fourier TransformAdvances in Mathematics, 1979
- Graph-theoretic properties in computational complexityJournal of Computer and System Sciences, 1976
- Note on a Lower Bound on the Linear Complexity of the Fast Fourier TransformJournal of the ACM, 1973