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.
Type de document :
Article dans une revue
IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2014, 60 (8), pp.4999-5007
Liste complète des métadonnées

Littérature citée [20 références]  Voir  Masquer  Télécharger

https://hal-ens-lyon.archives-ouvertes.fr/ensl-00747908
Contributeur : Pascal Koiran <>
Soumis le : vendredi 2 novembre 2012 - 17:30:38
Dernière modification le : jeudi 7 février 2019 - 14:25:49
Document(s) archivé(s) le : dimanche 3 février 2013 - 03:37:27

Fichiers

planted.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

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

Collections

Citation

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〉

Partager

Métriques

Consultations de la notice

443

Téléchargements de fichiers

109