Pages that link to "Item:Q1253097"

The following pages link to \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication (Q1253097):

Displaying 15 items.

• Fast matrix multiplication and its algebraic neighbourhood (Q4610195) (← links)
• On best rank-2 and rank-(2,2,2) approximations of order-3 tensors (Q4975109) (← links)
• On the Geometry of Border Rank Algorithms for <i><i>n</i> × 2</i> by <i>2 × 2</i> Matrix Multiplication (Q4976181) (← links)
• Further Limitations of the Known Approaches for Matrix Multiplication (Q4993288) (← links)
• (Q5089178) (← links)
• (Q5092471) (← links)
• A Rank 18 Waring Decomposition of <i>sM</i>_〈3〉 with 432 Symmetries (Q5163157) (← links)
• Tensors in computations (Q5887832) (← links)
• Skew-polynomial-sparse matrix multiplication (Q6051113) (← links)
• The approximate bilinear complexity of the multiplication of matrices of sizes \(2\times n\) and \(n\times 4\) (Q6082202) (← links)
• Partial Degeneration of Tensors (Q6130652) (← links)
• On the closures of monotone algebraic classes and variants of the determinant (Q6582370) (← links)
• A refined laser method and faster matrix multiplication (Q6601301) (← links)
• Complex matrix inversion via real matrix inversions (Q6644044) (← links)
• The tensor Rank of \(5 \times 5\) matrices multiplication is bounded by 98 andits border Rank by 89 (Q6666556) (← links)