Pages that link to "Item:Q2930272"
From MaRDI portal
The following pages link to Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function (Q2930272):
Displaying 8 items.
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP (Q494789) (← links)
- A faster polynomial-space algorithm for Max 2-CSP (Q899585) (← links)
- \(H\)-colouring \(P_t\)-free graphs in subexponential time (Q2322884) (← links)
- Bipartition polynomials, the Ising model, and domination in graphs (Q2344022) (← links)
- Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets (Q3448816) (← links)
- Efficient algorithms for three‐dimensional axial and planar random assignment problems (Q5175234) (← links)
- Faster graph coloring in polynomial space (Q5925619) (← links)