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.
- Compressed sensing
- computational complexity
- restricted isometry property
ASJC Scopus subject areas
- Information Systems
- Computer Science Applications
- Library and Information Sciences