Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials (Q1690044)
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
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials |
scientific article |
Statements
Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials (English)
0 references
18 January 2018
0 references
approximation algorithms
0 references
independence polynomial
0 references
Tutte polynomial
0 references
partition function
0 references
Holant problem
0 references
