Skip to main content
Conference Proceedings

On memory requirements of Strassen's algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1976) 45 LNCS 404-407
DOI: 10.1007/3-540-07854-1_206
4Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In the paper we analyse the memory problem of Strassens algorithms for fast matrix multiplication and inversion.

Cite

CITATION STYLE

APA

Kreczmar, A. (1976). On memory requirements of Strassen’s algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 45 LNCS, pp. 404–407). Springer Verlag. https://doi.org/10.1007/3-540-07854-1_206

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free