A New Algorithm for Computing Correlations
IEEE Transactions on Computers
Error Complexity Analysis of Algorithms for Matrix Multiplication and Matrix Chain Product
IEEE Transactions on Computers
Two Dimensional Aggregation Procedure: An Alternative to the Matrix Algebraic Algorithm
Computational Economics
A fast cellular method of matrix multiplication
Cybernetics and Systems Analysis
A mixed cellular method of matrix multiplication
Cybernetics and Systems Analysis
IBM Journal of Research and Development
Fast hybrid matrix multiplication algorithms
Cybernetics and Systems Analysis
Parallelism and Array Processing
IEEE Transactions on Computers
Optimization techniques for small matrix multiplication
Theoretical Computer Science
Brief paper: Sensitivity of linear time invariant sampled data systems to sampling period
Automatica (Journal of IFAC)
A new multi-linear universal hash family
Designs, Codes and Cryptography
| Hi-index | 15.00 |
Abstract In this note we describe a new way of computing the inner product of two vectors. This method cuts down the number of multiplications required when we want to perform a large number of inner products on a smaller set of vectors. In particular, we obtain that the product of two n脳n matrices can be performed using roughly n3/2 multiplications instead of the n3multiplications which the regular method necessitates.