Sparse approximation is provably hard under coherent dictionaries (Q340554): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65F50 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65Y20 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68Q17 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6652737 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
sparse approximation | |||
Property / zbMATH Keywords: sparse approximation / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
complexity | |||
Property / zbMATH Keywords: complexity / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
PCP | |||
Property / zbMATH Keywords: PCP / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
unique games | |||
Property / zbMATH Keywords: unique games / rank | |||
Normal rank |
Revision as of 06:04, 28 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Sparse approximation is provably hard under coherent dictionaries |
scientific article |
Statements
Sparse approximation is provably hard under coherent dictionaries (English)
0 references
14 November 2016
0 references
sparse approximation
0 references
complexity
0 references
PCP
0 references
unique games
0 references