The following pages link to (Q4542575):
Displayed 6 items.
- Complexity of approximating CSP with balance/hard constraints (Q315529) (← links)
- Minimum 2SAT-DELETION: Inapproximability results and relations to minimum vertex cover (Q867859) (← links)
- Worst-case study of local search for MAX-\(k\)-SAT. (Q1408379) (← links)
- The complexity of minimal satisfiability problems (Q1887137) (← links)
- Robustly Solvable Constraint Satisfaction Problems (Q2817797) (← links)
- Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs (Q5203794) (← links)