The Complexity of Approximating the Matching Polynomial in the Complex Plane (Q5065635)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The Complexity of Approximating the Matching Polynomial in the Complex Plane |
scientific article; zbMATH DE number 7495903
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0 references
0.90390635
0 references
0.8969603
0 references
0.8904744
0 references
0.8892778
0 references
0.8864615
0 references
0.88066185
0 references
