The Complexity of Approximately Counting Tree Homomorphisms (Q2943573)

From MaRDI portal
Revision as of 17:02, 10 July 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
The Complexity of Approximately Counting Tree Homomorphisms
scientific article

    Statements

    title
    The Complexity of Approximately Counting Tree Homomorphisms (English)
    0 references
    author
    Leslie Ann Goldberg
    0 references
    Mark R. Jerrum
    0 references
    publication date
    3 September 2015
    0 references
    zbMATH Keywords
    complexity classes
    0 references
    counting problems
    0 references
    graph homomorphisms
    0 references
    reducibility
    0 references
    cites work
    Q5387664
    0 references
    Q4660717
    0 references
    Q4521549
    0 references
    Q5815557
    0 references
    Q3416249
    0 references

    Identifiers

    DOI
    10.1145/2600917
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    05C05
    0 references
    68Q15
    0 references
    68R10
    0 references
    82B20
    0 references
    82C20
    0 references
    zbMATH DE Number
    6478365
    0 references
    OpenAlex ID
    W3105782517
    0 references
    arXiv ID
    1305.6306
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2943573&oldid=36199118"
    Powered by MediaWiki