Yale Song, Zhen Wen, et al.
IJCAI 2013
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.
Yale Song, Zhen Wen, et al.
IJCAI 2013
Hiroshi Kanayama, Tetsuya Nasukawa
Natural Language Engineering
Maan Qraitem, Kate Saenko, et al.
CVPR 2023
Karan Bhanot, Ioana Baldini, et al.
AIES 2023