Complexity and rank of bilinear mappings.- Elementary properties of rank and approximate rank of bilinear mappings.- Multiplication of large matrices.- Complexity and rank of finite dimensional associative algebras.- Algorithm varieties.
Series: Lecture Notes in Computer Science
Number Of Pages: 135
Published: 1st January 1987
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 24.18 x 16.61
Weight (kg): 0.24