"Sparse approximation is provably hard under coherent dictionaries."

Ali Çivril (2017)

> Home

Details and statistics

DOI: 10.1016/J.JCSS.2016.07.001

access: closed

type: Journal Article

metadata version: 2020-06-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jcss/Civril17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcss/Civril17
Ali Çivril:
Sparse approximation is provably hard under coherent dictionaries. J. Comput. Syst. Sci. 84: 32-43 (2017)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.