Items related to Lectures on the Complexity of Bilinear Problems (Lecture...
Synopsis
Development of the complexity theory of bilinear mappings in a uniform and coordinate-free 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.
- PublisherSpringer Verlag
- ISBN 10 038717205X
- ISBN 13 9780387172057
- BindingPaperback
- LanguageEnglish
- Edition number1
- Number of pages135
Search results for Lectures on the Complexity of Bilinear Problems (Lecture...
Stock Image
Lectures on the Complexity of Bilinear Problems (Lecture Notes in Computer Science)
Seller: The Book Cellar, LLC, Nashua, NH, U.S.A.
Seller rating 4 out of 5 stars
paperback. Condition: Very Good. Ex-Library copy with some moderate shelf wear. A portion of your purchase of this book will be donated to non-profit organizations.Over 1,000,000 satisfied customers since 1997! Choose expedited shipping (if available) for much faster delivery. Delivery confirmation on all US orders. Seller Inventory # 10228005
Quantity: 1 available