The following pages link to Robust Satisfiability for CSPs (Q2947586):
Displaying 14 items.
- Complexity of approximating CSP with balance/hard constraints (Q315529) (← links)
- A new line of attack on the dichotomy conjecture (Q896081) (← links)
- Towards a characterization of constant-factor approximable finite-valued CSPs (Q1671996) (← links)
- Robustly solvable constraint satisfaction problems (Q2817797) (← links)
- On algebras with many symmetric operations (Q2821826) (← links)
- Sherali-Adams Relaxations for Valued CSPs (Q3448860) (← links)
- (Q4993594) (← links)
- The Complexity of Valued CSPs (Q4993602) (← links)
- Solving CSPs Using Weak Local Consistency (Q5009788) (← links)
- (Q5089260) (← links)
- Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs (Q5203794) (← links)
- The Power of Linear Programming for General-Valued CSPs (Q5252658) (← links)
- The Power of Sherali--Adams Relaxations for General-Valued CSPs (Q5348454) (← links)
- CLAP: A New Algorithm for Promise CSPs (Q5885595) (← links)