Keywords
MathematicsMultiplication (music)Matrix multiplicationBilinear interpolationUpper and lower boundsMultiplication algorithmCombinatoricsMatrix (chemical analysis)Discrete mathematicsArithmeticChemistryMathematical analysisPhysics
Affiliated Institutions
Related Publications
An algorithm for constructing the aspect graph
In this paper we present tight bounds on the maximum size of aspect graphs and give worstcase optimal algorithms for their construction, first in the convex case and then in the...
Efficient MATLAB Computations with Sparse and Factored Tensors
In this paper, the term tensor refers simply to a multidimensional or N-way array, and we consider how specially structured tensors allow for efficient storage and computation. ...
Candelinc: A General Approach to Multidimensional Analysis of Many-Way Arrays with Linear Constraints on Parameters
Very general multilinear models, called CANDELINC, and a practical least-squares fitting procedure, also called CANDELINC, are described for data consisting of a many-way array....
Partitioning Sparse Matrices with Eigenvectors of Graphs
The problem of computing a small vertex separator in a graph arises in the context of computing a good ordering for the parallel factorization of sparse, symmetric matrices. An ...
Publication Info
- Year
- 2003
- Type
- article
- Volume
- 19
- Issue
- 1
- Pages
- 43-60
- Citations
- 74
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
74
OpenAlex
Cite This
Markus Bläser
(2003).
On the complexity of the multiplication of matrices of small formats.
Journal of Complexity
, 19
(1)
, 43-60.
https://doi.org/10.1016/s0885-064x(02)00007-9
Identifiers
- DOI
- 10.1016/s0885-064x(02)00007-9