Pages that link to "Item:Q2946643"

The following pages link to Complexity of conservative constraint satisfaction problems (Q2946643):

Displaying 50 items.

• Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
• Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms (Q415269) (← links)
• The complexity of surjective homomorphism problems-a survey (Q444433) (← links)
• Qualitative constraint satisfaction problems: an extended framework with landmarks (Q490417) (← links)
• Gap theorems for robust satisfiability: Boolean CSPs and beyond (Q527405) (← links)
• Hard constraint satisfaction problems have hard gaps at location 1 (Q837178) (← links)
• Digraph matrix partitions and trigraph homomorphisms (Q860407) (← links)
• Conservative constraint satisfaction re-revisited (Q896026) (← links)
• Consistent query answering for primary keys in Datalog (Q2035471) (← links)
• Complexity of correspondence \(H\)-colourings (Q2184689) (← links)
• Constraint satisfaction problems over semilattice block Mal'tsev algebras (Q2272992) (← links)
• Dichotomy for tree-structured trigraph list homomorphism problems (Q2275926) (← links)
• A quasi-Mal'cev condition with unexpected application. (Q2351514) (← links)
• On planar valued CSPs (Q2396724) (← links)
• Correspondence homomorphisms to reflexive graphs (Q2413143) (← links)
• A dichotomy for minimum cost graph homomorphisms (Q2427539) (← links)
• Minimum cost and list homomorphisms to semicomplete digraphs (Q2492190) (← links)
• Dichotomy for finite tournaments of mixed-type (Q2515599) (← links)
• CSP for binary conservative relational structures (Q2634708) (← links)
• Minimum Cost Homomorphisms with Constrained Costs (Q2817862) (← links)
• Adjusted Interval Digraphs (Q2839215) (← links)
• Minimax problems of discrete optimization invariant under majority operators (Q2940529) (← links)
• (Q3304148) (← links)
• A Galois Connection for Valued Constraint Languages of Infinite Size (Q3448812) (← links)
• Algebraic Properties of Valued Constraint Satisfaction Problem (Q3448842) (← links)
• Necessary Conditions for Tractability of Valued CSPs (Q3455247) (← links)
• (Q4993594) (← links)
• (Q4993595) (← links)
• The Complexity of Valued CSPs (Q4993602) (← links)
• Algebra and the Complexity of Digraph CSPs: a Survey (Q4993603) (← links)
• The Complexity of General-Valued Constraint Satisfaction Problems Seen from the Other Side (Q5026391) (← links)
• (Q5091138) (← links)
• Testing the Complexity of a Valued CSP Language (Q5091236) (← links)
• (Q5091252) (← links)
• Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy (Q5096441) (← links)
• Time Complexity of Constraint Satisfaction via Universal Algebra (Q5111231) (← links)
• (Q5136286) (← links)
• On the Computational Complexity of Non-Dictatorial Aggregation (Q5154769) (← links)
• Constant-Query Testability of Assignments to Constraint Satisfaction Problems (Q5232319) (← links)
• The Power of Linear Programming for General-Valued CSPs (Q5252658) (← links)
• Aggregation of Votes with Multiple Positions on Each Issue (Q5283212) (← links)
• The Complexity of General-Valued CSPs (Q5283238) (← links)
• The Power of Sherali--Adams Relaxations for General-Valued CSPs (Q5348454) (← links)
• Binarisation for Valued Constraint Satisfaction Problems (Q5371026) (← links)
• Bounded Tree-Width and CSP-Related Problems (Q5387797) (← links)
• (Q5863854) (← links)
• CSP beyond tractable constraint languages (Q6154179) (← links)
• (Q6185533) (← links)
• Unifying the three algebraic approaches to the CSP via minimal Taylor algebras (Q6566475) (← links)
• Graphs of finite algebras: maximality, rectangularity, and decomposition (Q6631352) (← links)