Lectures on the Complexity of Bilinear Problems [electronic resource] / by Hans F. Groote.
Material type:
TextSeries: Lecture Notes in Computer Science ; 245Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1987Description: VIII, 140 p. online resourceContent type: - text
- computer
- online resource
- 9783540473985
- 005.1 23
- QA76.9.A43
Contents:
In:
Springer eBooks
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.
E-BOOKS
| Home library | Call number | Materials specified | URL | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|---|
| IMSc Library | Link to resource | Available | EBK6068 |
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.
There are no comments on this title.
Log in to your account to post a comment.