Matrix-by-matrix multiplication algorithm with $O(N^{2}lo{g}_{2}N)$ computational complexity for variable precision arithmetic

Maciej Paszyński

We show that assuming the availability of the processor with variable precision arithmetic, we can compute matrix-by-matrix multiplications in $O(N^{2}lo{g}_{2}N)$ computational complexi…