Pages that link to "Item:Q1408379"

The following pages link to Worst-case study of local search for MAX-\(k\)-SAT. (Q1408379):

Displaying 9 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)
• A constructive proof of swap local search worst-case instances for the maximum coverage problem (Q1790189) (← 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)
• SAT local search algorithms: Worst-case study (Q2749857) (← links)
• Moderately exponential time and fixed parameter approximation algorithms (Q2868915) (← links)
• The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT (Q3637173) (← links)