Pages that link to "Item:Q1408379"
From MaRDI portal
The following pages link to Worst-case study of local search for MAX-\(k\)-SAT. (Q1408379):
Displaying 6 items.
- An exponential time 2-approximation algorithm for bandwidth (Q392018) (← links)
- Approximating MAX SAT by moderately exponential and parameterized algorithms (Q477187) (← links)
- Solving sparse instances of Max SAT via width reduction and greedy restriction (Q905695) (← links)
- Improved exact algorithms for mildly sparse instances of MAX SAT (Q2405896) (← links)
- A new algorithm for optimal 2-constraint satisfaction and its implications (Q2581276) (← links)
- Moderately exponential time and fixed parameter approximation algorithms (Q2868915) (← links)
