The following pages link to (Q4501522):
Displayed 17 items.
- MAX-2-SAT (Q15887) (← links)
- 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)
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012) (← links)
- Improving exact algorithms for MAX-2-SAT (Q812398) (← links)
- An upper (lower) bound for Max (Min) CSP (Q893727) (← links)
- Solving sparse instances of Max SAT via width reduction and greedy restriction (Q905695) (← links)
- Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. (Q1408377) (← links)
- Worst-case study of local search for MAX-\(k\)-SAT. (Q1408379) (← links)
- On the lower bounds of random Max 3 and 4-SAT (Q1752631) (← links)
- A tighter upper bound for random MAX \(2\)-SAT (Q1944049) (← links)
- Improved exact algorithms for mildly sparse instances of MAX SAT (Q2405896) (← links)
- Linear-programming design and analysis of fast algorithms for Max 2-CSP (Q2427689) (← links)
- New exact algorithms for the 2-constraint satisfaction problem (Q2437759) (← links)
- An Empirical Study of MAX-2-SAT Phase Transitions (Q3439118) (← links)
- On the Lower Bounds of Random Max 3 and 4-SAT (Q4632196) (← links)
- Exact Algorithms for MAX-SAT (Q4916231) (← links)