Abstract
This paper is concerned with an important matrix condition in compressed sensing known as the restricted isometry property (RIP). We demonstrate that testing whether a matrix satisfies RIP is NP-hard. As a consequence of our result, it is impossible to efficiently test for RIP provided P= NP.
Original language | English (US) |
---|---|
Article number | 6478822 |
Pages (from-to) | 3448-3450 |
Number of pages | 3 |
Journal | IEEE Transactions on Information Theory |
Volume | 59 |
Issue number | 6 |
DOIs | |
State | Published - 2013 |
All Science Journal Classification (ASJC) codes
- Information Systems
- Computer Science Applications
- Library and Information Sciences
Keywords
- Compressed sensing
- computational complexity
- restricted isometry property