On the Time Required to Perform Multiplication
- 1 October 1967
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 14 (4), 793-802
- https://doi.org/10.1145/321420.321438
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.Keywords
This publication has 1 reference indexed in Scilit:
- On the Time Required to Perform AdditionJournal of the ACM, 1965