Affiliation:
1. International Business Machines Corporation, Thomas J. Watson Research Center, Yorktown Heights, New York
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference6 articles.
1. On the Time Required to Perform Addition
2. SRANKS D. Solved and Unsolved Problems in Number Theory. Spartan Books Washington D. C. 1962. SRANKS D. Solved and Unsolved Problems in Number Theory. Spartan Books Washington D. C. 1962.
Cited by
44 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献