Lectures on the Complexity of Bilinear Problems: 245 (Lecture Notes in Computer Science, 245) - Softcover

Groote, Hans F. De

 
9783540172055: Lectures on the Complexity of Bilinear Problems: 245 (Lecture Notes in Computer Science, 245)

Synopsis

Development of the complexity theory of bilinear mappings in a uniform and coordinatefree manner. Main topic is the bilinear complexity of finite dimensional associative algebras with unity: Upper bounds for the complexity of matrix multiplication and a general lower bound for the complexity and algebraic structure in the case of algebras of minimal rank is shown. Final chapter is on the study of isotropy groups of bilinear mappings and the structure of the variety of optimal algorithms for bilinear mapping. Development of the complexity theory of bilinear mappings in a uniform and coordinatefree manner. Main topic is the bilinear complexity of finite dimensional associative algebras with unity: Upper bounds for the complexity of matrix multiplication and a general lower bound for the complexity and algebraic structure in the case of algebras of minimal rank is shown. Final chapter is on the study of isotropy groups of bilinear mappings and the structure of the variety of optimal algorithms for bilinear mapping.

"synopsis" may belong to another edition of this title.

Other Popular Editions of the Same Title

9780387172057: Lectures on the Complexity of Bilinear Problems (Lecture Notes in Computer Science)

Featured Edition

ISBN 10:  038717205X ISBN 13:  9780387172057
Publisher: Springer Verlag, 1987
Softcover