The Complexity of Approximating the Matching Polynomial in the Complex Plane (Q5065635)

From MaRDI portal
Revision as of 23:05, 19 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7495903
Language Label Description Also known as
English
The Complexity of Approximating the Matching Polynomial in the Complex Plane
scientific article; zbMATH DE number 7495903

    Statements

    The Complexity of Approximating the Matching Polynomial in the Complex Plane (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 March 2022
    0 references
    approximate counting
    0 references
    connective constant
    0 references
    matchings
    0 references
    monomer-dimer model
    0 references
    partition functions
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references