Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials (Q1690044): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.endm.2017.07.061 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.ENDM.2017.07.061 / rank | |||
Normal rank | |||
Latest revision as of 03:52, 11 December 2024
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
