Keywords

Matrix multiplicationMathematicsMultiplication (music)Matrix (chemical analysis)Strassen algorithmGeneralizationProduct (mathematics)Ring (chemistry)Multiplication algorithmCombinatoricsArithmeticAlgorithmDiscrete mathematics

Affiliated Institutions

Related Publications

A Comparison of Signalling Alphabets

E. N. Gilbert

Two channels are considered; a discrete channel which can transmit sequences of binary digits, and a continuous channel which can transmit band limited signals. The performance ...

1952 Bell System Technical Journal 529 citations

Algorithm 862

Brett W. Bader , Tamara G. Kolda

Tensors (also known as multidimensional arrays or N -way arrays) are used in a variety of applications ranging from chemometrics to psychometrics. We describe four MATLAB classe...

2006 ACM Transactions on Mathematical Soft... 448 citations

Publication Info

Year
1979
Type
article
Volume
8
Issue
5
Pages
234-235
Citations
210
Access
Closed

External Links

View on DOI.org

Social Impact

Altmetric
PlumX Metrics

Social media, news, blog, policy document mentions

Citation Metrics

210
OpenAlex

Cite This

Dario A. Bini, Milvio Capovani, Francesco Romani et al. (1979). O(n2.7799) complexity for n × n approximate matrix multiplication. Information Processing Letters , 8 (5) , 234-235. https://doi.org/10.1016/0020-0190(79)90113-3

Identifiers

DOI
10.1016/0020-0190(79)90113-3