# On the asymptotic complexity of matrix multiplication

@article{Coppersmith1981OnTA, title={On the asymptotic complexity of matrix multiplication}, author={Don Coppersmith and Shmuel Winograd}, journal={22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)}, year={1981}, pages={82-90} }

The main results of this paper have the following flavor: given one algorithm for multiplying matrices, there exists another, better, algorithm. A consequence of these results is that ω, the exponent for matrix multiplication, is a limit point, that is, cannot be realized by any single algorithm. We also use these results to construct a new algorithm which shows that ω ≪ 2.495364.

## 25 Citations

On Computing the Determinant in Small Parallel Time Using a Small Number of Processors

- Computer Science, MathematicsInf. Process. Lett.
- 1984

Fast rectangular matrix multiplications and improving parallel matrix computations

- Mathematics, Computer SciencePASCO '97
- 1997

The known algorithms for the sequential multiplication of rectangular matrix multiplication are accelerated to yield an improvement of the current recordymptotically bounds on the deterministic arithmetic NC pr~ ceaaor complexit of the four former ones.

A $θ(n^2)$ Time Matrix Multiplication Algorithm

- Computer Science, MathematicsArXiv
- 2016

It is shown that the 3 multiplications in (a0, a1, ..., a3m−1) T can be converted to 2 ( 2m+5 5 ) multiplications, which gives a θ(n) time algorithm for matrix multiplication.

The Bit Operation Complexity of Approximate Evaluation of Matrix and Polynomial Products Using Modular Arithmetic

- Computer Science
- 1982

Fast Parallel Computation of Polynomials Using Few Processes

- Computer ScienceMFCS
- 1981

It is shown that any multivariate polynomial that can be computed sequentially in C steps and has degree d can be computed in parallel in 0((log d) (log C + log d)) steps using only (Cd)0(1)…

Fast Parallel Computation of Polynomials Using Few Processors

- Computer ScienceSIAM J. Comput.
- 1983

It is shown that any multivariate polynomial of degree d that can be compute sequentially in C steps can be computed in parallel in O(1) using only $(Cd)^{O(1)} processors.

A Dominance-Based Constrained Optimization Evolutionary Algorithm for the 4-th Tensor Power Problem of Matrix Multiplication

- Computer ScienceICCCS
- 2018

A dominance-based constrained optimization evolutionary algorithm that can effectively solve the 4-th tensor power problem of matrix multiplication and the feasible solution obtained by this algorithm is better than the current known solution of the problem.

Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication

- Computer Science
- 1982

Efficient Parallel Evaluation of Straight-line Code and Arithmetric Circuits

- Computer ScienceAegean Workshop on Computing
- 1986

A new parallel algorithm is given to evaluate a straight line program over a commutative semi-ring R of degree d and size n in time O(log n( log nd)) using M(n) processors, where M( n) is the number of processors required for multiplying n×n matrices over the semi- ring R in O (log n) time.

## References

SHOWING 1-10 OF 15 REFERENCES

On the Asymptotic Complexity of Matrix Multiplication

- Computer Science, MathematicsSIAM J. Comput.
- 1982

A consequence of these results is that $\omega $, the exponent for matrix multiplication, is a limit point, that is, it cannot be realized by any single algorithm.

Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms

- Mathematics, Computer ScienceSIAM J. Comput.
- 1973

The paper considers the complexity of bilinear forms in a noncommutative ring. The dual of a computation is defined and applied to matrix multiplication and other bilinear forms. It is shown that t...

Partial and Total Matrix Multiplication

- Mathematics, Computer ScienceSIAM J. Comput.
- 1981

By combining Pan’s trilinear technique with a strong version of the compression theorem for the case of several disjoint matrix multiplications it is shown that multiplication of N \times N matrices (over arbitrary fields) is possible in time.

Relations between exact and approximate bilinear algorithms. Applications

- Computer Science
- 1980

The relation betweenAPA-algorithms andEC-algorithm of complexity (1+d)t0, an application for problems associated to tensorial powers of a tensor, such as matrix product, is analyzed.

New combinations of methods for the acceleration of matrix multiplications

- Computer Science
- 1981

The computational complexity of algebraic and numeric problems

- Computer ScienceElsevier computer science library
- 1975

Thank you for downloading the computational complexity of algebraic and numeric problems elsevier computer science library theory of computation series 1. As you may know, people have search numerous…

Vermeidung von Divisionen.

- Mathematics
- 1973

The extent to whieh the use of divisions may speed up the evaluation of polynomials is estimated from above. In particular it is shown that for multiplying general matrices the use of divisions does…

Gaussian elimination is not optimal

- Mathematics
- 1969

t. Below we will give an algorithm which computes the coefficients of the product of two square matrices A and B of order n from the coefficients of A and B with tess than 4 . 7 n l°g7 arithmetical…

Algebra

- MathematicsNature
- 1941

THIS is a text–book intended primarily for undergraduates. It is designed to give a broad basis of knowledge comprising such theories and theorems in those parts of algebra which are mentioned in the…

Pan, New Combinations of Methods for the Accerleration of Matrix Multiplication

- SUNYA Report
- 1980