Hidden cliques and the certification of the restricted isometry property - Archive ouverte HAL Access content directly
Journal Articles IEEE Transactions on Information Theory Year : 2014

Hidden cliques and the certification of the restricted isometry property

(1, 2, 3) , (4)
1
2
3
4

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.
Fichier principal
Vignette du fichier
planted.pdf (214.59 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

ensl-00747908 , version 1 (02-11-2012)

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook Twitter LinkedIn More