A note on compressed sensing and the complexity of matrix multiplication (Q987795)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A note on compressed sensing and the complexity of matrix multiplication |
scientific article; zbMATH DE number 5771242
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on compressed sensing and the complexity of matrix multiplication |
scientific article; zbMATH DE number 5771242 |
Statements
A note on compressed sensing and the complexity of matrix multiplication (English)
0 references
16 August 2010
0 references
analysis of algorithms
0 references
approximation algorithms
0 references
computational complexity
0 references
0 references
0.8001748323440552
0 references
0.7814911603927612
0 references
0.7622047066688538
0 references
0.7622047066688538
0 references
0.7562084794044495
0 references
