Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function
From MaRDI portal
Publication:2930272
DOI10.1145/1597036.1597049zbMath1298.68256arXivcs/0604079OpenAlexW2035135174MaRDI QIDQ2930272
No author found.
Publication date: 18 November 2014
Published in: (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0604079
No records found.
No records found.
Related Items (8)
Tractability in constraint satisfaction problems: a survey ⋮ Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets ⋮ A faster polynomial-space algorithm for Max 2-CSP ⋮ A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP ⋮ Efficient algorithms for three‐dimensional axial and planar random assignment problems ⋮ Faster graph coloring in polynomial space ⋮ \(H\)-colouring \(P_t\)-free graphs in subexponential time ⋮ Bipartition polynomials, the Ising model, and domination in graphs
This page was built for publication: Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function
