Pages that link to "Item:Q3912015"
From MaRDI portal
The following pages link to Partial and Total Matrix Multiplication (Q3912015):
Displaying 50 items.
- On bilinear algorithms over fields of different characteristics (Q264010) (← links)
- On the arithmetic complexity of Strassen-like matrix multiplications (Q346560) (← links)
- On the third secant variety (Q478356) (← links)
- On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices (Q483185) (← links)
- Optimization techniques for small matrix multiplication (Q533859) (← links)
- A note on border rank (Q794161) (← links)
- On commutativity and approximation (Q799369) (← links)
- The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations (Q800727) (← links)
- The Faddeev-LeVerrier algorithm and the Pfaffian (Q820990) (← links)
- Matrix multiplication via arithmetic progressions (Q915378) (← links)
- Fast rectangular matrix multiplication and some applications (Q931517) (← links)
- Lower bounds in algebraic computational complexity (Q1057648) (← links)
- Typical tensorial rank (Q1064383) (← links)
- Improved lower bounds for some matrix multiplication problems (Q1068534) (← links)
- Border rank of m\(\times n\times (mn-q)\) tensors (Q1079634) (← links)
- On the order of approximation in approximative triadic decompositions of tensors (Q1123957) (← links)
- Shortest-path problem is not harder than matrix multiplication (Q1149782) (← links)
- On the algorithmic complexity of associative algebras (Q1154260) (← links)
- New combinations of methods for the acceleration of matrix multiplication (Q1154805) (← links)
- Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication (Q1158927) (← links)
- Reply to the paper ''The numerical instability of Bini's algorithm'' (Q1162356) (← links)
- Fast matrix multiplication without APA-algorithms (Q1168050) (← links)
- On the asymptotic complexity of rectangular matrix multiplication (Q1173402) (← links)
- Fast rectangular matrix multiplication and applications (Q1271174) (← links)
- Multiplicative complexity of direct sums of quadratic systems (Q1347225) (← links)
- On the complexity of the multiplication of matrices of small formats (Q1394936) (← links)
- On Comon's and Strassen's conjectures (Q1634665) (← links)
- Tensor rank is not multiplicative under the tensor product (Q1698592) (← links)
- Fast structured matrix computations: tensor rank and Cohn-Umans method (Q1704813) (← links)
- Beyond the Alder-Strassen bound. (Q1770421) (← links)
- The matrix capacity of a tensor (Q1947657) (← links)
- An adaptive procedure for the global minimization of a class of polynomial functions (Q2004881) (← links)
- Rank and border rank of Kronecker powers of tensors and Strassen's laser method (Q2062866) (← links)
- Equivalent polyadic decompositions of matrix multiplication tensors (Q2074879) (← links)
- A note on VNP-completeness and border complexity (Q2122788) (← links)
- Bounds on complexity of matrix multiplication away from Coppersmith-Winograd tensors (Q2154275) (← links)
- Fast commutative matrix algorithms (Q2156374) (← links)
- An introduction to the computational complexity of matrix multiplication (Q2176822) (← links)
- HPMaX: heterogeneous parallel matrix multiplication using CPUs and GPUs (Q2212501) (← links)
- Progress on the symmetric Strassen conjecture (Q2341528) (← links)
- Unifying known lower bounds via geometric complexity theory (Q2351393) (← links)
- A bilinear algorithm of length \(22\) for approximate multiplication of \(2\times 7\) and \(7\times 2\) matrices (Q2354472) (← links)
- Abelian tensors (Q2398420) (← links)
- Asymptotic tensor rank of graph tensors: beyond matrix multiplication (Q2422766) (← links)
- Fast hybrid matrix multiplication algorithms (Q2452754) (← links)
- Geometric conditions for strict submultiplicativity of rank and border rank (Q2662176) (← links)
- The bilinear complexity and practical algorithms for matrix multiplication (Q2940335) (← links)
- Geometry and the complexity of matrix multiplication (Q3498865) (← links)
- Fast matrix multiplication and its algebraic neighbourhood (Q4610195) (← links)
- (Q4638074) (← links)
