A note on compressed sensing and the complexity of matrix multiplication
type: Item
instance of: scholarly article
title: A note on compressed sensing and the complexity of matrix multiplication
zbMATH Open document ID: 1215.68284
published in: Information Processing Letters
publication date: 2010-08-16T00:00:00Z
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 94A12
zbMATH DE Number: 5771242
zbMATH Keywords: analysis of algorithms
zbMATH Keywords: approximation algorithms
zbMATH Keywords: computational complexity
author: M. A. Iwen
author: C. V. Spencer
MaRDI profile type: Publication
full work available at URL: j.ipl.2009.01.010
OpenAlex ID: W2119272727
cites work: The space complexity of approximating the frequency moments
cites work: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
cites work: Rapid Multiplication of Rectangular Matrices
cites work: Rectangular matrix multiplication revisited
cites work: Matrix multiplication via arithmetic progressions
cites work: Combinatorial Algorithms for Compressed Sensing
cites work: Compressed sensing
cites work: Probabilistic counting algorithms for data base applications
cites work: Q3579464
cites work: Q3579463
cites work: Geometry and the complexity of matrix multiplication
cites work: On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
DOI: 10.1016/J.IPL.2009.01.010
description: scientific article; zbMATH DE number 5771242