Algebraic complexity theory. II: Tast matrix multiplication and combinatorics.
From MaRDI portal
(Redirected from Publication:1380697)
Recommendations
Cited in
(15)- Some computational problems in linear algebra as hard as matrix multiplication
- Gaussian elimination is not optimal, revisited
- scientific article; zbMATH DE number 1419996 (Why is no real title available?)
- scientific article; zbMATH DE number 151736 (Why is no real title available?)
- The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations
- The matrix capacity of a tensor
- Polynomials and the exponent of matrix multiplication
- scientific article; zbMATH DE number 4088834 (Why is no real title available?)
- Matrix multiplication via arithmetic progressions
- On obtaining upper bounds on the complexity of matrix multiplication
- Fast matrix multiplication and its algebraic neighbourhood
- On the complexity of matrix reduction over finite fields
- Improved bound for complexity of matrix multiplication
- scientific article; zbMATH DE number 727424 (Why is no real title available?)
- Asymptotic spectrum and matrix multiplication
This page was built for publication: Algebraic complexity theory. II: Tast matrix multiplication and combinatorics.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1380697)