Pages that link to "Item:Q2457608"
From MaRDI portal
The following pages link to The complexity of soft constraint satisfaction (Q2457608):
Displayed 39 items.
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- Classes of submodular constraints expressible by graph cuts (Q606899) (← links)
- Hybrid tractability of valued constraint problems (Q646503) (← links)
- On the complexity of submodular function minimisation on diamonds (Q665998) (← links)
- A semiring-based framework for the deduction/abduction reasoning in access control with weighted credentials (Q692280) (← links)
- The complexity of approximating conservative counting CSPs (Q743130) (← links)
- Non-local configuration of component interfaces by constraint satisfaction (Q823765) (← links)
- Maximum \(H\)-colourable subdigraphs and constraint optimization with arbitrary weights (Q881590) (← links)
- Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms (Q935141) (← links)
- The expressive power of valued constraints: Hierarchies and collapses (Q959827) (← links)
- The expressive power of binary submodular functions (Q967393) (← links)
- Soft arc consistency revisited (Q969527) (← links)
- A note on some collapse results of valued constraints (Q987814) (← links)
- Minimization of locally defined submodular functions by optimal soft arc consistency (Q1020491) (← links)
- Towards a characterization of constant-factor approximable finite-valued CSPs (Q1671996) (← links)
- Minimum 0-extension problems on directed metrics (Q2042078) (← links)
- Minimizing submodular functions on diamonds via generalized fractional matroid matchings (Q2171023) (← links)
- Using a Min-Cut generalisation to go beyond Boolean surjective VCSPs (Q2211354) (← links)
- The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems (Q2235760) (← links)
- On planar valued CSPs (Q2396724) (← links)
- Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis (Q2922627) (← links)
- The Expressive Power of Binary Submodular Functions (Q3182971) (← links)
- A Galois Connection for Valued Constraint Languages of Infinite Size (Q3448812) (← links)
- Algebraic Properties of Valued Constraint Satisfaction Problem (Q3448842) (← links)
- Sherali-Adams Relaxations for Valued CSPs (Q3448860) (← links)
- Necessary Conditions for Tractability of Valued CSPs (Q3455247) (← links)
- The Expressive Power of Valued Constraints: Hierarchies and Collapses (Q3523088) (← links)
- Soft Constraints Processing over Divisible Residuated Lattices (Q3638207) (← links)
- The Complexity of Valued CSPs (Q4993602) (← links)
- The Complexity of General-Valued Constraint Satisfaction Problems Seen from the Other Side (Q5026391) (← links)
- Sum-of-Products with Default Values: Algorithms and Complexity Results (Q5076308) (← links)
- (Q5090503) (← links)
- The Complexity of Boolean Surjective General-Valued CSPs (Q5111218) (← links)
- The Power of Linear Programming for General-Valued CSPs (Q5252658) (← links)
- The Complexity of General-Valued CSPs (Q5283238) (← links)
- The Power of Sherali--Adams Relaxations for General-Valued CSPs (Q5348454) (← links)
- Introduction to the Maximum Solution Problem (Q5504706) (← links)
- (Q5743434) (← links)
- Tractability of explaining classifier decisions (Q6098842) (← links)