Joxan Jaffar
Journal of the ACM
Paper
On the Time Required to Perform Multiplication
Abstract
The time required to perform multiplication is investigated. A lower bound on the time required to perform multiplication, as well as multiplication modulo N, is derived and it is shown that these lower bounds can be approached. Then a lower bound on the amount of time required to perform the most significant part of multiplication (xy/N) is derived. © 1967, ACM. All rights reserved.
Related
Arthur Nádas
IEEE Transactions on Neural Networks
John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence
Conference paper
Bias Mimicking: A Simple Sampling Approach for Bias Mitigation
Maan Qraitem, Kate Saenko, et al.
CVPR 2023