scientific article; zbMATH DE number 3412083
From MaRDI portal
zbMath0261.65025MaRDI QIDQ5676984
Publication date: 1972
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Parallel evaluation of the determinant and of the inverse of a matrix, The aggregation and cancellation techniques as a practical tool for faster matrix multiplication, The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented \(\lambda\) algorithms, Symmetric tensor decomposition, The bit-operation complexity of matrix multiplication and of all pair shortest path problem, Using duality for the synthesis of an optimal algorithm involving matrix multiplication, New combinations of methods for the acceleration of matrix multiplication, The lower bounds on the additive complexity of bilinear problems in terms of some algebraic quantities, Fast matrix multiplication and its algebraic neighbourhood, Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication, Fast matrix multiplication without APA-algorithms, Fast rectangular matrix multiplication and some applications, Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization, Optimal Karatsuba-like formulae for certain bilinear forms in GF(2), Randomized preprocessing of homogeneous linear systems of equations, Strassen's \(2 \times 2\) matrix multiplication algorithm: a conceptual perspective, Fast rectangular matrix multiplication and applications, The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations
