David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence
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
R.A. Brualdi, A.J. Hoffman
Linear Algebra and Its Applications
Matthew A Grayson
Journal of Complexity
Fernando Martinez, Tao Li, et al.
ICLR 2026