Technical Report CS0575

Title: Multiplicative Complexity of Direct Sum of Quadratic Systems
Authors: Nader H. Bshouty
Abstract: We consider the quadratic complexity of certain sets of quadratic forms. We study classes of direct sums of quadratic fonnl. For these classes of problems we show that the complexity of one direct sum is the sum of the complexity of the summands and that every minimal quadratic algorithm for computing the direct sums is a direct-sum algorithm.

Key Words: multiplicative complexity. direct sum, quadratic algorithms. bilinear algorithms. algebras.

CopyrightThe above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information

Remark: Any link to this technical report should be to this page (, rather than to the URL of the PDF files directly. The latter URLs may change without notice.

To the list of the CS technical reports of 1989
To the main CS technical reports page

Computer science department, Technion