Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials (Q4602373)
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: Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials |
scientific article; zbMATH DE number 6823706
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials |
scientific article; zbMATH DE number 6823706 |
Statements
Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials (English)
0 references
10 January 2018
0 references
approximation algorithms
0 references
Tutte polynomial
0 references
independence polynomial
0 references
partition function
0 references
graph homomorphism
0 references
Holant problem
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9610424041748048
0 references
0.8343837857246399
0 references
0.8020251393318176
0 references
0.7900940775871277
0 references
