On the arithmetic complexity of Strassen-like matrix multiplications
From MaRDI portal
Publication:346560
DOI10.1016/j.jsc.2016.07.004zbMath1353.68309WikidataQ114154472 ScholiaQ114154472MaRDI QIDQ346560
Publication date: 29 November 2016
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/11511/31534
computational complexity; computer algebra; cryptographic computations; fast matrix multiplication; Strassen-like matrix multiplication
68W30: Symbolic computation and algebraic computation
Uses Software