Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function (Q2930272): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / author | |||
| Property / author: Q222637 / rank | |||
| Property / author | |||
| Property / author: Alexander D. Scott / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2035135174 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: cs/0604079 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10: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
