On the complexity of bilinear computations
Arithmetic complexity theory is the study of the minimum number of non-scalar multiplications required to compute a set of bilinear forms. One can show that we can restrict ourselves to bilinear algorithms. Brockett and Dobkin showed that the problem is equivalent to minimizing the number of rank on...
Saved in:
| Main Author: | |
|---|---|
| Format: | masterThesis |
| Published: |
1984
|
| Online Access: | http://hdl.handle.net/10725/7391 http://libraries.lau.edu.lb/research/laur/terms-of-use/thesis.php https://dl.acm.org/citation.cfm?id=911876 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|