Nimrod Megiddo
Journal of Symbolic Computation
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
Leo Liberti, James Ostrowski
Journal of Global Optimization
Arnon Amir, Michael Lindenbaum
IEEE Transactions on Pattern Analysis and Machine Intelligence
Yixiong Chen, Weichuan Fang
Engineering Analysis with Boundary Elements