Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm
From MaRDI portal
Publication:2883800
DOI10.1145/1576702.1576713zbMath1237.68252OpenAlexW2145889866MaRDI QIDQ2883800
Wei Zhou, Brice Boyer, Clément Pernet
Publication date: 13 May 2012
Published in: Proceedings of the 2009 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.214.1361
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
On the arithmetic complexity of Strassen-like matrix multiplications ⋮ Pebbling Game and Alternative Basis for High Performance Matrix Multiplication ⋮ Rank-profile revealing Gaussian elimination and the CUP matrix decomposition ⋮ Fast matrix multiplication and its algebraic neighbourhood
Uses Software
This page was built for publication: Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm
