Conference paper
On Trajectory Augmentations for Off-Policy Evaluation
Ge Gao, Qitong Gao, et al.
ICLR 2024
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.
Ge Gao, Qitong Gao, et al.
ICLR 2024
Weiming Hu, Nianhua Xie, et al.
IEEE TPAMI
Yale Song, Zhen Wen, et al.
IJCAI 2013
Akari Asai, Zeqiu Wu, et al.
ICLR 2024