A New Algorithm for Inner Product
From MaRDI portal
Cited in
(32)- A very personal reminiscence on the problem of computational complexity
- Computing powers of arbitrary Hessenberg matrices
- Über eine Methode zur Lösung eines linearen Gleichungssystems
- Variants of Wegman-Carter message authentication code supporting variable tag lengths
- Fast rectangular matrix multiplication and QR decomposition
- Fast algorithms for the basic operation of cellular methods of linear algebra
- New fast hybrid matrix multiplication algorithms
- Fast matrix multiplication and its algebraic neighbourhood
- Computational methods of linear algebra
- Algorithms for fast convolutions on motion groups
- On rate-1 and beyond-the-birthday bound secure online ciphers using tweakable block ciphers
- A fast cellular method of matrix multiplication
- A mixed cellular method of matrix multiplication
- On a Newton-Moser type method
- A fast recursive algorithm for multiplying matrices of order \(n = 3^q\) \((q > 1)\)
- 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
- Gaussian elimination is not optimal
- A new fast recursive matrix multiplication algorithm
- Fast hybrid matrix multiplication algorithms
- A matrix extension of Winograd's inner product algorithm
- An algorithm for computing powers of a Hessenberg matrix and its applications
- Complex matrix inversion via real matrix inversions
- Modes of operations for encryption and authentication using stream ciphers supporting an initialisation vector
- Reducing the number of multiplications in iterative processes
- Two dimensional aggregation procedure: An alternative to the matrix algebraic algorithm
- A new multi-linear universal hash family
- RIV for robust authenticated encryption
- Optimization techniques for small matrix multiplication
- Sensitivity of linear time-invariant sampled data systems to sampling period
- A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
- Untersuchungen des Zeitgewinns durch neue Algorithmen zur Matrix- Multiplikation
This page was built for publication: A New Algorithm for Inner Product
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5563038)
