The additive and logical complexities of linear and bilinear arithmetic algorithms
Author:
- V.Ya PanVPV.Ya Pan
- 1 March 1983
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 4 (1) , 1-34
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- The bit-operation complexity of approximate evaluation of matrix and polynomial products using modular arithmeticComputers & Mathematics with Applications, 1982
- New combinations of methods for the acceleration of matrix multiplicationsComputers & Mathematics with Applications, 1981
- Algebras Having Linear Multiplicative ComplexitiesJournal of the ACM, 1977
- Addition Requirements for Rational FunctionsSIAM Journal on Computing, 1977
- Note on a Lower Bound on the Linear Complexity of the Fast Fourier TransformJournal of the ACM, 1973
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965