Skip to Main content Skip to Navigation
Journal articles

Hidden cliques and the certification of the restricted isometry property

Abstract : Compressed sensing is a technique for finding sparse solutions to underdetermined linear systems. This technique relies on properties of the sensing matrix such as the restricted isometry property. Sensing matrices that satisfy this property with optimal parameters are mainly obtained via probabilistic arguments. Deciding whether a given matrix satisfies the restricted isometry property is a non-trivial computational problem. Indeed, we show in this paper that restricted isometry parameters cannot be approximated in polynomial time within any constant factor under the assumption that the hidden clique problem is hard. Moreover, on the positive side we propose an improvement on the brute-force enumeration algorithm for checking the restricted isometry property.
Document type :
Journal articles
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download
Contributor : Pascal Koiran Connect in order to contact the contributor
Submitted on : Friday, November 2, 2012 - 5:30:38 PM
Last modification on : Saturday, September 11, 2021 - 3:17:29 AM
Long-term archiving on: : Sunday, February 3, 2013 - 3:37:27 AM


Files produced by the author(s)


  • HAL Id : ensl-00747908, version 1
  • ARXIV : 1211.0665



Pascal Koiran, Anastasios Zouzias. Hidden cliques and the certification of the restricted isometry property. IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2014, 60 (8), pp.4999-5007. ⟨ensl-00747908⟩



Les métriques sont temporairement indisponibles