Corrigendum: The complexity of counting graph homomorphisms (Q3159461)

From MaRDI portal
Revision as of 22:23, 19 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
Corrigendum: The complexity of counting graph homomorphisms
scientific article

    Statements

    title
    Corrigendum: The complexity of counting graph homomorphisms (English)
    0 references
    author
    Martin Dyer
    0 references
    Catherine Greenhill
    0 references
    publication date
    16 February 2005
    0 references

    Identifiers

    DOI
    10.1002/rsa.20036
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    05C85
    0 references
    68R05
    0 references
    zbMATH DE Number
    2134291
    0 references
    Wikidata QID
    Q56323935
    0 references
    OpenAlex ID
    W2141321698
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3159461&oldid=32166081"
    Powered by MediaWiki