Pages that link to "Item:Q4911805"
From MaRDI portal
The following pages link to The Complexity of Valued Constraint Satisfaction Problems (Q4911805):
Displayed 21 items.
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- On a general framework for network representability in discrete optimization (Q1631628) (← links)
- Discrete convexity in joint winner property (Q1662162) (← links)
- Polynomial combinatorial algorithms for skew-bisubmodular function minimization (Q1785196) (← links)
- Minimum 0-extension problems on directed metrics (Q2042078) (← links)
- New width parameters for SAT and \#SAT (Q2238644) (← links)
- On $k$-Submodular Relaxation (Q2820856) (← links)
- On a General Framework for Network Representability in Discrete Optimization (Q2835692) (← links)
- Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex Intersection. (Q3304138) (← links)
- Community Structure Inspired Algorithms for SAT and #SAT (Q3453228) (← links)
- Necessary Conditions for Tractability of Valued CSPs (Q3455247) (← links)
- Discrete Convex Functions on Graphs and Their Algorithmic Applications (Q4689627) (← links)
- A Tractable Class of Binary VCSPs via M-Convex Intersection (Q4972691) (← links)
- The Complexity of Valued CSPs (Q4993602) (← links)
- (Q5089214) (← links)
- Solving LP Relaxations of Some NP-Hard Problems Is As Hard As Solving Any Linear Program (Q5231683) (← links)
- The Power of Linear Programming for General-Valued CSPs (Q5252658) (← links)
- Discrete convexity and polynomial solvability in minimum 0-extension problems (Q5962712) (← links)
- Activity propagation in systems of linear inequalities and its relation to block-coordinate descent in linear programs (Q6049435) (← links)
- Super-reparametrizations of weighted CSPs: properties and optimization perspective (Q6049436) (← links)
- (Q6193828) (← links)