The Exponential Time complexity of counting (quantum) graph homomorphisms (Q2301557)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The Exponential Time complexity of counting (quantum) graph homomorphisms
scientific article

    Statements

    The Exponential Time complexity of counting (quantum) graph homomorphisms (English)
    0 references
    0 references
    0 references
    0 references
    24 February 2020
    0 references
    graph homomorphisms
    0 references
    Exponential Time Hypothesis
    0 references
    counting complexity
    0 references
    complexity dichotomy
    0 references
    surjective homomorphisms
    0 references

    Identifiers