Pages that link to "Item:Q4619419"
From MaRDI portal
The following pages link to A $2{\mathbf{n}}^2-{\text{log}}_2({\mathbf{n}})-1$ lower bound for the border rank of matrix multiplication (Q4619419):
Displaying 17 items.
- The rank of \(n \times n\) matrix multiplication is at least \(3n^2 - 2\sqrt{2}n^{\frac{3}{2}} - 3n\) (Q389730) (← links)
- A note on border rank (Q794161) (← links)
- A note on VNP-completeness and border complexity (Q2122788) (← links)
- An introduction to the computational complexity of matrix multiplication (Q2176822) (← links)
- Towards a geometric approach to Strassen's asymptotic rank conjecture (Q2228323) (← links)
- Tensor surgery and tensor rank (Q2422765) (← links)
- Algebraic geometry and representation theory in the study of matrix multiplication complexity and other problems in theoretical computer science (Q2672320) (← links)
- On the structure tensor of \(\mathfrak{sl}_n\) (Q2676747) (← links)
- New lower bounds for the border rank of matrix multiplication (Q2941634) (← links)
- The border support rank of two-by-two matrix multiplication is seven (Q4615808) (← links)
- On the Geometry of Border Rank Algorithms for <i><i>n</i> × 2</i> by <i>2 × 2</i> Matrix Multiplication (Q4976181) (← links)
- Border Rank Is Not Multiplicative under the Tensor Product (Q5382574) (← links)
- (Q6041403) (← links)
- Partial Degeneration of Tensors (Q6130652) (← links)
- Bad and good news for Strassen's laser method: border rank of \(\mathrm{Perm}_3\) and strict submultiplicativity (Q6142335) (← links)
- New lower bounds for matrix multiplication and (Q6161101) (← links)
- A refined laser method and faster matrix multiplication (Q6601301) (← links)
