Hardness of approximating the minimum solutions of linear Diophantine equations (Q1022600)

From MaRDI portal
Revision as of 22:23, 10 July 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
Hardness of approximating the minimum solutions of linear Diophantine equations
scientific article

    Statements

    Hardness of approximating the minimum solutions of linear Diophantine equations (English)
    0 references
    0 references
    0 references
    22 June 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    NP-hardness
    0 references
    computational complexity
    0 references
    linear Diophantine equations
    0 references
    approximation
    0 references