Pages that link to "Item:Q2905390"
From MaRDI portal
The following pages link to Tractable Triangles and Cross-Free Convexity in Discrete Optimisation (Q2905390):
Displayed 11 items.
- Broken triangles: from value merging to a tractable class of general-arity constraint satisfaction problems (Q253988) (← links)
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- Modularity-based decompositions for valued CSP (Q353312) (← links)
- Discrete convexity in joint winner property (Q1662162) (← links)
- Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns (Q2341755) (← links)
- Variable and value elimination in binary constraint satisfaction via forbidden patterns (Q2353394) (← links)
- Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex Intersection. (Q3304138) (← links)
- A Tractable Class of Binary VCSPs via M-Convex Intersection (Q4972691) (← links)
- Hybrid Tractable Classes of Constraint Problems (Q4993597) (← links)
- The Complexity of Valued CSPs (Q4993602) (← links)
- Tractability of explaining classifier decisions (Q6098842) (← links)