Conference paper
Reasoning about Noisy Sensors in the Situation Calculus
Fahiem Bacchus, Joseph Y. Halpern, et al.
IJCAI 1995
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.
Fahiem Bacchus, Joseph Y. Halpern, et al.
IJCAI 1995
Baihan Lin, Guillermo Cecchi, et al.
IJCAI 2023
Erik Altman, Jovan Blanusa, et al.
NeurIPS 2023
David Eppstein, Zvi Galil, et al.
Journal of the ACM