Thumbnail
Access Restriction
Subscribed

Author Winograd, S.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1967
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract The time required to perform multiplication is investigated. A lower bound on the time required to perform multiplication, as well as multiplication modulo $\textit{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 $(⌞\textit{xy}/\textit{N}⌟)$ is derived.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1967-10-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 14
Issue Number 4
Page Count 10
Starting Page 793
Ending Page 802


Open content in new tab

   Open content in new tab
Source: ACM Digital Library