Pages that link to "Item:Q3088277"

The following pages link to A New Bound for 3-Satisfiable Maxsat and Its Algorithmic Application (Q3088277):

Displaying 11 items.

• Parameterized complexity of MaxSat above average (Q392026) (← links)
• A new bound for 3-satisfiable MaxSat and its algorithmic application (Q393085) (← links)
• Fixed-parameter tractability of satisfying beyond the number of variables (Q528862) (← links)
• A new lower bound on the maximum number of satisfied clauses in Max-SAT and its algorithmic applications (Q1759685) (← links)
• New methods for 3-SAT decision and worst-case analysis (Q1960406) (← links)
• Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey (Q2908541) (← links)
• A dichotomy theorem for constraint satisfaction problems on a 3-element set (Q3546290) (← links)
• Conditional Hardness of Approximating Satisfiable Max 3CSP-q (Q3652279) (← links)
• New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem (Q4317711) (← links)
• (Q4375761) (← links)
• The Approximability of Three-valued MAX CSP (Q5470737) (← links)