Matthew A Grayson
Journal of Complexity
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
Guo-Jun Qi, Charu Aggarwal, et al.
IEEE TPAMI
Joy Y. Cheng, Daniel P. Sanders, et al.
SPIE Advanced Lithography 2008
Ehud Altman, Kenneth R. Brown, et al.
PRX Quantum