Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function (Q2930272): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: cs/0604079 / rank | |||
Normal rank | |||
Latest revision as of 09:58, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function |
scientific article |
Statements
Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function (English)
0 references
18 November 2014
0 references
exponential-time algorithm
0 references
constraint satisfaction
0 references
discrete optimization
0 references
exact algorithm
0 references
generating function
0 references
partition function
0 references
