Pages that link to "Item:Q393085"
From MaRDI portal
The following pages link to A new bound for 3-satisfiable MaxSat and its algorithmic application (Q393085):
Displaying 10 items.
- 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)
- A New Bound for 3-Satisfiable Maxsat and Its Algorithmic Application (Q3088277) (← 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)
- (Q4993600) (← links)
- The Approximability of Three-valued MAX CSP (Q5470737) (← links)
- On the parallel parameterized complexity of MaxSAT variants (Q6535422) (← links)