![Lectures on the Complexity of Bilinear Problems [electronic resource] /](/search/themes/bootstrap3/images/libros.png)
Lectures on the Complexity of Bilinear Problems [electronic resource] /
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.
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Texto biblioteca |
| Language: | eng |
| Published: |
Berlin, Heidelberg : Springer Berlin Heidelberg,
1987
|
| Subjects: | Computer science., Algorithms., Numerical analysis., Computer Science., Algorithm Analysis and Problem Complexity., Numerical Analysis., |
| Online Access: | http://dx.doi.org/10.1007/BFb0020719 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|