Pages that link to "Item:Q4203811"
From MaRDI portal
The following pages link to A Lower Bound for Matrix Multiplication (Q4203811):
Displaying 10 items.
- On the additive complexity of 2 \(\times 2\) matrix multiplication (Q672835) (← links)
- A lower bound for periods of matrices (Q850946) (← links)
- Entropy of operators or why matrix multiplication is hard for depth-two circuits (Q970107) (← links)
- Multiplicative complexity of direct sums of quadratic systems (Q1347225) (← links)
- Lower bounds on zero-one matrices. (Q1415303) (← links)
- Beyond the Alder-Strassen bound. (Q1770421) (← links)
- The lower-bound estimate of \(D[X_{2m}]\) and fast construction of matrix \(X_{2m}\) (Q2732389) (← links)
- Improved bound for complexity of matrix multiplication (Q2837114) (← links)
- Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications. (Q3304115) (← links)
- Fast matrix multiplication and its algebraic neighbourhood (Q4610195) (← links)
