Leo Liberti, James Ostrowski
Journal of Global Optimization
Paper
On the algebraic complexity of inner product
Abstract
The number of binary operations required to compute ∑ i=1 xiyi nis shown to be 2n - 1 even when auxiliary functions are used. © 1971.
Related
Conference paper
Placement of multimedia blocks on zoned disks
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996
A.R. Conn, Nick Gould, et al.
Mathematics of Computation
Yi Zhou, Parikshit Ram, et al.
ICLR 2023