Pages that link to "Item:Q458466"

The following pages link to Colouring, constraint satisfaction, and complexity (Q458466):

Displaying 29 items.

• Constraint satisfaction and semilinear expansions of addition over the rationals and the reals (Q269512) (← links)
• Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
• Obstructions to partitions of chordal graphs (Q383740) (← links)
• Connected obstructions to full graph homomorphisms (Q740288) (← links)
• \(H\)-coloring degree-bounded (acyclic) digraphs (Q744083) (← links)
• In praise of homomorphisms (Q826325) (← links)
• A new line of attack on the dichotomy conjecture (Q896081) (← links)
• Dualities in full homomorphisms (Q1041189) (← links)
• A combinatorial constraint satisfaction problem dichotomy classification conjecture (Q1041203) (← links)
• Binary constraint satisfaction problems defined by excluded topological minors (Q1633806) (← links)
• A complexity dichotomy for signed \(\mathbf{H}\)-colouring (Q1660261) (← links)
• Reflexive graphs with near unanimity but no semilattice polymorphisms (Q1991407) (← links)
• A tetrachotomy of ontology-mediated queries with a covering axiom (Q2152500) (← links)
• Using a Min-Cut generalisation to go beyond Boolean surjective VCSPs (Q2211354) (← links)
• The \(C_{k}\)-extended graft construction (Q2275937) (← links)
• On planar valued CSPs (Q2396724) (← links)
• Graph partitions with prescribed patterns (Q2509761) (← links)
• Binary simple homogeneous structures are supersimple with finite rank (Q2790281) (← links)
• A Galois Connection for Valued Constraint Languages of Infinite Size (Q3448812) (← links)
• Necessary Conditions for Tractability of Valued CSPs (Q3455247) (← links)
• ON CONSTRAINTS AND DIVIDING IN TERNARY HOMOGENEOUS STRUCTURES (Q4647122) (← links)
• (Q4934341) (← links)
• Hybrid Tractable Classes of Constraint Problems (Q4993597) (← links)
• Backdoor Sets for CSP. (Q4993598) (← links)
• The Complexity of Valued CSPs (Q4993602) (← links)
• (Q5090503) (← links)
• Homogeneous 1‐based structures and interpretability in random structures (Q5108085) (← links)
• The Power of Linear Programming for General-Valued CSPs (Q5252658) (← links)
• (Q5743434) (← links)