Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials (Q1690044): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1607.01167 / rank | |||
Normal rank | |||
Revision as of 20:52, 18 April 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
