The following pages link to (Q2728900):
Displaying 12 items.
- A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between (Q414887) (← links)
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012) (← links)
- A new upper bound for Max-2-SAT: A graph-theoretic approach (Q616992) (← 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)
- Improved exact algorithms for MAX-SAT (Q1878397) (← links)
- Improved exact algorithms for mildly sparse instances of MAX SAT (Q2405896) (← links)
- Exact MAX-2SAT solution via lift-and-project closure (Q2466587) (← links)
- A new algorithm for optimal 2-constraint satisfaction and its implications (Q2581276) (← links)
- A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach (Q3599157) (← links)
- A Spectral Method for MAX2SAT in the Planted Solution Model (Q5387750) (← links)
