The following pages link to (Q5676984):
Displaying 18 items.
- The aggregation and cancellation techniques as a practical tool for faster matrix multiplication (Q598219) (← links)
- Symmetric tensor decomposition (Q603116) (← links)
- Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization (Q660795) (← links)
- The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations (Q800727) (← links)
- Fast rectangular matrix multiplication and some applications (Q931517) (← links)
- Optimal Karatsuba-like formulae for certain bilinear forms in GF(2) (Q947669) (← links)
- Randomized preprocessing of homogeneous linear systems of equations (Q968998) (← links)
- Parallel evaluation of the determinant and of the inverse of a matrix (Q1115596) (← links)
- The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented \(\lambda\) algorithms (Q1121670) (← links)
- The bit-operation complexity of matrix multiplication and of all pair shortest path problem (Q1152952) (← links)
- Using duality for the synthesis of an optimal algorithm involving matrix multiplication (Q1154261) (← links)
- New combinations of methods for the acceleration of matrix multiplication (Q1154805) (← links)
- The lower bounds on the additive complexity of bilinear problems in terms of some algebraic quantities (Q1157165) (← links)
- Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication (Q1158927) (← links)
- Fast matrix multiplication without APA-algorithms (Q1168050) (← links)
- Fast rectangular matrix multiplication and applications (Q1271174) (← links)
- Strassen's \(2 \times 2\) matrix multiplication algorithm: a conceptual perspective (Q2280138) (← links)
- Fast matrix multiplication and its algebraic neighbourhood (Q4610195) (← links)
