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
Conference paper
Compression for data archiving and backup revisited
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009
Fausto Bernardini, Holly Rushmeier
Proceedings of SPIE - The International Society for Optical Engineering
Robert F. Gordon, Edward A. MacNair, et al.
WSC 1985