The following pages link to (Q4440440):
Displaying 5 items.
- Complexity of approximating CSP with balance/hard constraints (Q315529) (← links)
- Universal Factor Graphs (Q2843260) (← links)
- Is constraint satisfaction over two variables always easy? (Q3156915) (← links)
- ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network (Q4993301) (← links)
- Every 2-CSP allows nontrivial approximation (Q5919233) (← links)