Pages that link to "Item:Q3087938"

The following pages link to Tight Bounds on Local Search to Approximate the Maximum Satisfiability Problems (Q3087938):

Displaying 7 items.

• CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability (Q502391) (← links)
• Approximating Max NAE-\(k\)-SAT by anonymous local search (Q507440) (← links)
• Worst-case study of local search for MAX-\(k\)-SAT. (Q1408379) (← links)
• Local Search to Approximate Max NAE-$$k$$-Sat Tightly (Q3452574) (← links)
• Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers (Q3524192) (← links)
• The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT (Q3637173) (← links)
• On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem (Q4930591) (← links)