Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences
The number of binary operations required to compute ∑ i=1 xiyi nis shown to be 2n - 1 even when auxiliary functions are used. © 1971.
Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences
Da-Ke He, Ashish Jagmohan, et al.
ISIT 2007
Vladimir Yanovski, Israel A. Wagner, et al.
Ann. Math. Artif. Intell.
T. Graham, A. Afzali, et al.
Microlithography 2000