L. Joskowicz, Elisha Sacks
aaai 1994
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.
L. Joskowicz, Elisha Sacks
aaai 1994
Karan Bhanot, Ioana Baldini, et al.
AIES 2023
Hong Guan, Saif Masood, et al.
SoCC 2023
Elron Bandel, Yotam Perlitz, et al.
NAACL 2024