On the algebraic complexity of inner product

The number of binary operations required to compute ∑ i=1 xiyi nis shown to be 2n - 1 even when auxiliary functions are used. © 1971.