
Accession Number : ADA112972
Title : The Lower Bounds on the Additive Complexity of Bilinear Problems in Terms of Some Algebraic Quantities,
Corporate Author : STANFORD UNIV CA DEPT OF COMPUTER SCIENCE
Personal Author(s) : Pan,V Ya
PDF Url : ADA112972
Report Date : Jun 1981
Pagination or Media Count : 5
Abstract : The lower bounds on the additive complexity of a bilinear problem are expressed in terms of the rank of the problem and also as a minimum number of elementary steps for the transformation of the identity matrix into a strongly regular one.
Descriptors : *Linear algebra, *Transformations(Mathematics), *Matrices(Mathematics), Identities, Algorithms, Tensor analysis, Computations, Input, Output, Variables, Rank order statistics
Subject Categories : Theoretical Mathematics
Distribution Statement : APPROVED FOR PUBLIC RELEASE