Pages that link to "Item:Q1380697"
From MaRDI portal
The following pages link to Algebraic complexity theory. II: Tast matrix multiplication and combinatorics. (Q1380697):
Displaying 8 items.
- Some computational problems in linear algebra as hard as matrix multiplication (Q685718) (← links)
- The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations (Q800727) (← links)
- Matrix multiplication via arithmetic progressions (Q915378) (← links)
- The matrix capacity of a tensor (Q1947657) (← links)
- Gaussian elimination is not optimal, revisited (Q2374312) (← links)
- On the complexity of matrix reduction over finite fields (Q2467342) (← links)
- Improved bound for complexity of matrix multiplication (Q2837114) (← links)
- Polynomials and the exponent of matrix multiplication (Q4572031) (← links)