P.C. Yue, C.K. Wong
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
Joseph Y. Halpern, Yoram Moses
Journal of the ACM
Rocco Langone, Carlos Alzate, et al.
SSCI 2013
Conference paper
Counterexample to theorems of Cox and Fine
Joseph Y. Halpern
aaai 1996