A Fast Recursive Algorithm for Multiplying Matrices of Order n = 3q (q > 1)
Crossref DOI link: https://doi.org/10.1007/s10559-021-00345-x
Published Online: 2021-04-01
Published Print: 2021-03
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Jelfimova, L. D.
Text and Data Mining valid from 2021-03-01
Version of Record valid from 2021-03-01
Article History
Received: 2 August 2019
First Online: 1 April 2021