Pages that link to "Item:Q837178"
From MaRDI portal
The following pages link to Hard constraint satisfaction problems have hard gaps at location 1 (Q837178):
Displaying 10 items.
- Complexity of approximating CSP with balance/hard constraints (Q315529) (← links)
- Strong partial clones and the time complexity of SAT problems (Q340559) (← links)
- \(H\)-coloring degree-bounded (acyclic) digraphs (Q744083) (← links)
- The approximability of constraint satisfaction problems (Q2706139) (← links)
- Robustly solvable constraint satisfaction problems (Q2817797) (← links)
- On the NP-hardness of approximating ordering-constraint satisfaction problems (Q2941635) (← links)
- Universal Factor Graphs for Every NP-Hard Boolean CSP. (Q2969623) (← links)
- A complete classification of the approximability of maximization problems derived from Boolean constraint satisfaction (Q4526965) (← links)
- A characterization of hard-to-cover CSPs (Q4601833) (← links)
- The Power of Linear Programming for General-Valued CSPs (Q5252658) (← links)