An optimal algorithm for matrix multiplication
From MaRDI portal
zbMATH Open0697.65038MaRDI QIDQ911703FDOQ911703
Authors: Changjun Jiang, Zhehui Wu 
Publication date: 1990
Published in: Chinese Science Bulletin (Search for Journal in Brave)
Recommendations
Cited In (23)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Improved algorithm of matrix multiplication based on memory
- On the Reuse of Additions in Matrix Multiplication
- Matrix-vector multiplication in sub-quadratic time (some preprocessing required)
- On the complexity of some algorithms of matrix multiplication
- Strassen's matrix multiplication algorithm for matrices of arbitrary order
- Synthesis of an Optimal Family of Matrix Multiplication Algorithms on Linear Arrays
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new algorithm for Boolean matrix multiplication
- Title not available (Why is that?)
- Algorithm 898
- On transformations of algorithms to multiply 2\(\times 2\) matrices
- On obtaining upper bounds on the complexity of matrix multiplication
- An algorithm for multiplication of concatenated matrices
- Title not available (Why is that?)
- The matrix capacity of a tensor
- Optimization techniques for small matrix multiplication
- A noncommutative algorithm for multiplying 5\(\times 5\) matrices using 102 multiplications
- Optimization techniques for small matrix multiplication
- A practical algorithm for faster matrix multiplication
- Title not available (Why is that?)
This page was built for publication: An optimal algorithm for matrix multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911703)
