scientific article; zbMATH DE number 151736

MaRDI QIDQ4031860zbMATH OpenFDO

Authors Zhenxiang Zhang

Publication date 12 May 1993

zbMATH Keywords

conventional algorithm

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Publication:4944595
• On bilinear complexity of multiplication of \(m\times 2\) and \(2\times 2\) matrices
• On an optimal algorithm for matrix multiplication
• Algebraic complexity theory. II: Tast matrix multiplication and combinatorics.
• An optimal algorithm for matrix multiplication

Cited in

(11)

• Complexities of special matrix multiplication problems
• The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented algorithms
• On an optimal algorithm for matrix multiplication
• On the complexity of integer matrix multiplication
• On the fraction of matrices with maximal additive complexity
• Relative bilinear complexity and matrix multiplication.
• scientific article; zbMATH DE number 4024638 (Why is no real title available?)
• scientific article; zbMATH DE number 1419996 (Why is no real title available?)
• scientific article; zbMATH DE number 6412845 (Why is no real title available?)
• scientific article; zbMATH DE number 7650266 (Why is no real title available?)
• An optimal algorithm for matrix multiplication

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4031860)