ON THE ALGEBRAIC COMPLEXITY OF INNER PRODUCT,
Abstract
The number of binary operations required to compute Summation from i=1 to i=n of (x sub i)(y sub i) is shown to be 2n-1 even when auxiliary functions are used. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Dec 10, 1969
- Accession Number
- AD0706784
Entities
People
- S. Winograd
Organizations
- IBM Thomas J. Watson Research Center