Strong computational lower bounds via parameterized complexity (Q856413)

From MaRDI portal
Revision as of 10:21, 25 June 2024 by ReferenceBot (talk | contribs) (‎Changed an 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

    title
    Strong computational lower bounds via parameterized complexity (English)
    0 references
    author
    Xiuzhen Huang
    0 references
    Iyad A. Kanj
    0 references
    Ge Xia
    0 references
    Jian'er Chen
    0 references
    publication date
    7 December 2006
    0 references
    zbMATH Keywords
    parameterized computation
    0 references
    computational complexity
    0 references
    lower bound
    0 references
    clique
    0 references
    polynomial time approximation scheme
    0 references

    Identifiers

    zbMATH DE Number
    5078609
    0 references
    OpenAlex ID
    W2130190334
    0 references
    Wikidata QID
    Q55891718
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q856413&oldid=34906954"
    Powered by MediaWiki