The Complexity of Approximating the Matching Polynomial in the Complex Plane (Q5065635): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:01, 8 February 2024
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
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
