On the Number of Multiplications Required to Compute Quadratic Functions,
Abstract
The paper is a study of the number of multiplications required for the evaluation of quadratic functions in n variables. Several sufficient conditions are presented for a requirement of j multiplications. A procedure is given for generating the optimal program for any quadratic function over a noncommutative ring. An application of these results solves an open problem posed by Knuth. Necessary and sufficient conditions are found for real and complex functions to require j multiplications. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jan 01, 1972
- Accession Number
- AD0736962
Entities
People
- Thomas Michael Vari
Organizations
- Department of Computer Science, Cornell University