Monotone arithmetic complexity of graph homomorphism polynomials (Q6077890)

From MaRDI portal
scientific article; zbMATH DE number 7742464
Language Label Description Also known as
English
Monotone arithmetic complexity of graph homomorphism polynomials
scientific article; zbMATH DE number 7742464

    Statements

    Monotone arithmetic complexity of graph homomorphism polynomials (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 September 2023
    0 references
    homomorphism polynomials
    0 references
    monotone complexity
    0 references
    algebraic complexity
    0 references
    graph algorithms
    0 references
    fine-grained complexity
    0 references
    fixed-parameter algorithms and complexity
    0 references
    treewidth
    0 references
    pathwidth
    0 references
    treedepth
    0 references
    graph homomorphisms
    0 references
    algebraic circuits
    0 references
    algebraic branching programs
    0 references
    algebraic formulas
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers