The bit-complexity of arithmetic algorithms
From MaRDI portal
Publication:3928236
DOI10.1016/0196-6774(81)90016-XzbMath0473.68028MaRDI QIDQ3928236
Publication date: 1981
Published in: Journal of Algorithms (Search for Journal in Brave)
discrete Fourier transform; arithmetic complexity; polynomial multiplication; time-complexity; space-complexity
68Q25: Analysis of algorithms and problem complexity
Related Items
Polynomial division and its computational complexity, The bit-cost of some algorithms for the solution of linear systems, The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented \(\lambda\) algorithms, The bit-operation complexity of matrix multiplication and of all pair shortest path problem, The bit-operation complexity of approximate evaluation of matrix and polynomial products using modular arithmetic