A New Algorithm for Inner Product
From MaRDI portal
Publication:5563038
DOI10.1109/TC.1968.227420zbMath0174.46703OpenAlexW1993929164MaRDI QIDQ5563038
Publication date: 1968
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tc.1968.227420
Related Items
Fast algorithms for the basic operation of cellular methods of linear algebra, A matrix extension of Winograd's inner product algorithm, Variants of Wegman-Carter message authentication code supporting variable tag lengths, A very personal reminiscence on the problem of computational complexity, Fast rectangular matrix multiplication and QR decomposition, A new multi-linear universal hash family, Computational methods of linear algebra, Fast matrix multiplication and its algebraic neighbourhood, New fast hybrid matrix multiplication algorithms, Two dimensional aggregation procedure: An alternative to the matrix algebraic algorithm, Fast hybrid matrix multiplication algorithms, A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications, RIV for Robust Authenticated Encryption, A fast cellular method of matrix multiplication, On rate-1 and beyond-the-birthday bound secure online ciphers using tweakable block ciphers, Optimization techniques for small matrix multiplication, On a Newton-Moser type method, Modes of operations for encryption and authentication using stream ciphers supporting an initialisation vector, Untersuchungen des Zeitgewinns durch neue Algorithmen zur Matrix- Multiplikation, An algorithm for computing powers of a Hessenberg matrix and its applications, Über eine Methode zur Lösung eines linearen Gleichungssystems, A new fast recursive matrix multiplication algorithm, Computing powers of arbitrary Hessenberg matrices, A fast recursive algorithm for multiplying matrices of order \(n = 3^q\) \((q > 1)\), Gaussian elimination is not optimal, Error analysis of algorithms for matrix multiplication and triangular decomposition using Winograd's identity, Structure and arithmetic complexity of products and inverses of Toeplitz matrices, Reducing the number of multiplications in iterative processes, A mixed cellular method of matrix multiplication, Algorithms for fast convolutions on motion groups, Sensitivity of linear time-invariant sampled data systems to sampling period
