Joy Y. Cheng, Daniel P. Sanders, et al.
SPIE Advanced Lithography 2008
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.B. Morris, Y. Tsuji, et al.
International Journal for Numerical Methods in Engineering
A.R. Conn, Nick Gould, et al.
Mathematics of Computation
Arnon Amir, Michael Lindenbaum
IEEE Transactions on Pattern Analysis and Machine Intelligence