Accession Number:

AD0706784

Title:

ON THE ALGEBRAIC COMPLEXITY OF INNER PRODUCT,

Descriptive Note:

Corporate Author:

IBM WATSON RESEARCH CENTER YORKTOWN HEIGHTS N Y

Personal Author(s):

Report Date:

1969-12-10

Pagination or Media Count:

6.0

Abstract:

The number of binary operations required to compute Summation from i1 to in of x sub iy sub i is shown to be 2n-1 even when auxiliary functions are used. Author

Subject Categories:

  • Theoretical Mathematics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE