Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials (Q4602373)
From MaRDI portal
scientific article; zbMATH DE number 6823706
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
