The bit-operation complexity of approximate evaluation of matrix and polynomial products using modular arithmetic
- 1 January 1982
- journal article
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 8 (2) , 137-140
- https://doi.org/10.1016/0898-1221(82)90052-9
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- On the asymptotic complexity of matrix multiplicationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- The bit-complexity of arithmetic algorithmsJournal of Algorithms, 1981
- The bit-operation complexity of matrix multiplication and of all pair shortest path problemComputers & Mathematics with Applications, 1981
- New combinations of methods for the acceleration of matrix multiplicationsComputers & Mathematics with Applications, 1981
- Computational Complexity and Numerical StabilitySIAM Journal on Computing, 1975