A note on the hardness of sparse approximation (Q2444766)

From MaRDI portal
Revision as of 16:00, 4 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A note on the hardness of sparse approximation
scientific article

    Statements

    A note on the hardness of sparse approximation (English)
    0 references
    0 references
    11 April 2014
    0 references
    approximation algorithms
    0 references
    computational complexity
    0 references
    sparse approximation
    0 references
    subset selection
    0 references
    complexity
    0 references
    inapproximability
    0 references

    Identifiers