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

Groote, Hans F. de

ISBN 10: 354017205X / ISBN 13: 9783540172055

Published by Springer, 1987

About this Item

Very Good.

Seller Inventory # ERICA790354017205X6

Bibliographic Details

• Title: Lectures on the Complexity of Bilinear Problems (Lecture Notes in Computer Science, 245)
• Publisher: Springer
• Publication Date: 1987
• Language: English
• ISBN 10: 354017205X
• ISBN 13: 9783540172055
• Binding: Paperback
• Condition: Very Good
• Book Type: book

About this title

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.