The following pages link to (Q5365140):
Displaying 8 items.
- Inapproximability results for set splitting and satisfiability problems with no mixed clauses (Q1879246) (← links)
- Hardness results for approximate pure Horn CNF formulae minimization (Q2254607) (← links)
- Robustly solvable constraint satisfaction problems (Q2817797) (← links)
- On the Approximability of Splitting-SAT in 2-CNF Horn Formulas (Q2870016) (← links)
- Tight bounds on the approximability of almost-satisfiable Horn SAT and exact hitting set (Q2913811) (← links)
- Approximation Algorithms for CSPs (Q4993604) (← links)
- The Quest for Strong Inapproximability Results with Perfect Completeness (Q5002604) (← links)
- Solving CSPs Using Weak Local Consistency (Q5009788) (← links)