The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
On the bit-complexity of sparse polynomial and series multiplication
Journal of Symbolic Computation
On the complexity of multivariate blockwise polynomial multiplication
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
| Hi-index | 0.00 |
The applicability of fast multiplication algorithms to sparse structures is discussed. Estimates for the degree of sparseness of matrices and polynomials are given for which fast multiplication algorithms have advantages over standard multiplication algorithms in terms of the multiplicative complexity. Specifically, the Karatsuba and Strassen algorithms are studied under the assumption of the uniform distribution of zero elements.