A.R. Conn, Nick Gould, et al.
Mathematics of 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
Matthew A Grayson
Journal of Complexity
Conference paper
Modeling polarization for Hyper-NA lithography tools and masks
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007
Paul J. Steinhardt, P. Chaudhari
Journal of Computational Physics