Pages that link to "Item:Q2427689"
From MaRDI portal
The following pages link to Linear-programming design and analysis of fast algorithms for Max 2-CSP (Q2427689):
Displaying 5 items.
- A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between (Q414887) (← links)
- A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP (Q494789) (← links)
- A new upper bound for Max-2-SAT: A graph-theoretic approach (Q616992) (← links)
- A faster polynomial-space algorithm for Max 2-CSP (Q899585) (← links)
- Solving sparse instances of Max SAT via width reduction and greedy restriction (Q905695) (← links)
