Strong computational lower bounds via parameterized complexity (Q856413)

From MaRDI portal
Revision as of 16:35, 9 July 2025 by CorrectionBot (talk | contribs) (‎Changed label, description and/or aliases in en, and other parts)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article; zbMATH DE number 5078609
Language Label Description Also known as
English
Strong computational lower bounds via parameterized complexity
scientific article; zbMATH DE number 5078609

    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