Computational Complexity of Certifying Restricted Isometry Property

From MaRDI portal

Revision as of 20:18, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2969632

Jump to:navigation, search

DOI10.4230/LIPIcs.APPROX-RANDOM.2014.371zbMath1359.68141arXiv1406.5791OpenAlexW2963363959MaRDI QIDQ2969632

Abhiram Natarajan, Yi Wu

Publication date: 22 March 2017

Full work available at URL: https://arxiv.org/abs/1406.5791

zbMATH Keywords

restricted isometry property RIP certification sparse Cheeger inequality SSE-hardness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Effective zero-norm minimization algorithms for noisy compressed sensing ⋮ The Restricted Isometry Property of Subsampled Fourier Matrices

This page was built for publication: Computational Complexity of Certifying Restricted Isometry Property

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2969632&oldid=15969367"