Vinayak Gupta, Rajmohan C, et al.
ICON 2022
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.
Vinayak Gupta, Rajmohan C, et al.
ICON 2022
Cynthia Dwork, Moni Naor, et al.
Journal of the ACM
Tessa Lau
AI Magazine
Rie Kubota Ando
CoNLL 2006