Strong computational lower bounds via parameterized complexity (Q856413)

From MaRDI portal
Revision as of 10:17, 6 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
Strong computational lower bounds via parameterized complexity
scientific article

    Statements

    Strong computational lower bounds via parameterized complexity (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 December 2006
    0 references
    parameterized computation
    0 references
    computational complexity
    0 references
    lower bound
    0 references
    clique
    0 references
    polynomial time approximation scheme
    0 references

    Identifiers