Complexity and approximability of the cover polynomial (Q445242)

From MaRDI portal
Revision as of 00:39, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Complexity and approximability of the cover polynomial
scientific article

    Statements

    title
    Complexity and approximability of the cover polynomial (English)
    0 references
    author
    Markus Bläser
    0 references
    Holger Dell
    0 references
    Mahmoud Fouz
    0 references
    publication date
    24 August 2012
    0 references
    zbMATH DE Number
    6072038
    0 references
    zbMATH Keywords
    graph polynomial
    0 references
    counting complexity
    0 references
    approximation
    0 references
    permanent
    0 references
    Tutte polynomial
    0 references
    OpenAlex ID
    W2058339257
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q445242&oldid=32425849"
    Powered by MediaWiki