The additive and logical complexities of linear and bilinear arithmetic algorithms
References (20)
The bit-operation complexity of approximate evaluation of matrix and polynomial products using modular arithmetic
Comput. Math. Appl.
(1982)New combinations of methods for the acceleration of matrix multiplication
Comput. Math. Appl.
(1981)- et al.
The Design and Analysis of Computer Algorithms
(1976) - et al.
The Computational Complexity of Algebraic and Numeric Problems
(1975) Arithmetic Complexity of Computations
(1980)- et al.
On the Asymptotic Complexity of Matrix Multiplication
(1981) The complexity of a scheme of functional elements
Dokl. Akad. Nauk SSSR
(1963)Soviet Math.
(1963)- et al.
An algorithm for the machine calculation of complex Fourier series
Math. Comp.
(1965) Discrete Fourier transform when the data samples are prime
There are more references available in the full text version of this article.
Cited by (2)
Fast fourier transforms: A tutorial review and a state of the art
1990, Signal ProcessingThe trade-off between the additive complexity and the asynchronicity of linear and bilinear algorithms
1986, Information Processing Letters
- ∗
This research has been supported by National Science Foundation Grant MSC-8003347, Institute for Advanced Study; by National Science Foundation grant MCS-77-23738 and Office of Naval Research Contract N00014-81-K-0269, Stanford University. Reproduction in whole or in part is permitted for any purpose of the United States government.
Copyright © 1983 Published by Elsevier Inc.