book chapter · Lecture notes in computer science · 1994
A transform approach to fast matrix multiplication
Cited by 2Abstract and details only
Abstract
The index has no abstract for this paper. The publisher’s page may have one.
Cite this paper
Berkhin, P., & Brown, J. M. (1994). A transform approach to fast matrix multiplication. Lecture notes in computer science, 67–79. https://doi.org/10.1007/bfb0030137
Berkhin, Pavel, and John M. Brown. “A transform approach to fast matrix multiplication.” Lecture notes in computer science, 1994, pp. 67–79, https://doi.org/10.1007/bfb0030137.
Berkhin, Pavel, and John M. Brown. 1994. “A transform approach to fast matrix multiplication.” Lecture notes in computer science: 67–79. https://doi.org/10.1007/bfb0030137.
Berkhin, P. and Brown, J.M. (1994) ‘A transform approach to fast matrix multiplication’, Lecture notes in computer science, pp. 67–79. Available at: https://doi.org/10.1007/bfb0030137.
@incollection{berkhin1994transform,
title = {{A transform approach to fast matrix multiplication}},
author = {Berkhin, Pavel and Brown, John M.},
booktitle = {Lecture notes in computer science},
pages = {67--79},
year = {1994},
doi = {10.1007/bfb0030137}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.
Related papers
Communication costs of Strassen's matrix multiplication
Grey Ballard, James Weldon Demmel, Olga Holtz et al. · Communications of the ACM · 2014
Cited by 20
Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm
Brice Boyer, Jean‐Guillaume Dumas, Clément Pernet et al. · International Symposium on Symbolic and Algebraic Computation · 2009
Cited by 48Open access
Improved algorithms for Boolean matrix multiplication via opportunistic matrix multiplication.
David G. Harris · arXiv (Cornell University) · 2021
Cited by 1Open access
MapReduce Implementation of Strassen's Algorithm for Matrix Multiplication
Minhao Deng, Prakash V. Ramanan · ACM SIGMOD Workshop on Algorithms and Systems for MapReduce and Beyond (BeyondMR) · 2017
Cited by 6Open access
О билинейной сложности умножения матриц размеров m х 2 и 2 х 2
Valeriy B. Alekseev · CyberLeninK (CyberLeninka) · 2015
Cited by 0