Pages that link to "Item:Q3642864"

The following pages link to The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell) (Q3642864):

Displayed 47 items.

• Tractability in constraint satisfaction problems: a survey (Q271997) ‎ (← links)
• Enumerating homomorphisms (Q414933) ‎ (← links)
• Colouring, constraint satisfaction, and complexity (Q458466) ‎ (← links)
• The structure of polynomial operations associated with smooth digraphs. (Q485112) ‎ (← links)
• The complexity of counting quantifiers on equality languages (Q515549) ‎ (← links)
• Rigid binary relations on a 4-element domain (Q523155) ‎ (← links)
• Gap theorems for robust satisfiability: Boolean CSPs and beyond (Q527405) ‎ (← links)
• A strong Mal'cev condition for locally finite varieties omitting the unary type (Q616117) ‎ (← links)
• Cyclic terms for \(\text{SD}_{\vee}\) varieties revisited (Q616130) ‎ (← links)
• The complexity of the list homomorphism problem for graphs (Q693060) ‎ (← links)
• The complexity of colouring by locally semicomplete digraphs (Q709314) ‎ (← links)
• Hard constraint satisfaction problems have hard gaps at location 1 (Q837178) ‎ (← links)
• A new line of attack on the dichotomy conjecture (Q896081) ‎ (← links)
• On the restricted homomorphism problem (Q948709) ‎ (← links)
• A combinatorial constraint satisfaction problem dichotomy classification conjecture (Q1041203) ‎ (← links)
• Congruence modularity implies cyclic terms for finite algebras (Q1047112) ‎ (← links)
• Oriented incidence colourings of digraphs (Q1630937) ‎ (← links)
• Axiomatisability and hardness for universal Horn classes of hypergraphs (Q1652862) ‎ (← links)
• A complexity dichotomy for signed \(\mathbf{H}\)-colouring (Q1660261) ‎ (← links)
• Circuit satisfiability and constraint satisfaction around Skolem arithmetic (Q1676359) ‎ (← links)
• On the complexity of \(\mathbb{H}\)-coloring for special oriented trees (Q1686250) ‎ (← links)
• Low-level dichotomy for quantified constraint satisfaction problems (Q1944186) ‎ (← links)
• The complexity of tropical graph homomorphisms (Q2012054) ‎ (← links)
• Constraint satisfaction problems over semilattice block Mal'tsev algebras (Q2272992) ‎ (← links)
• Characterizations of several Maltsev conditions. (Q2351504) ‎ (← links)
• Deciding absorption in relational structures (Q2407970) ‎ (← links)
• Analogues of cliques for \((m,n)\)-colored mixed graphs (Q2409513) ‎ (← links)
• Graph partitions with prescribed patterns (Q2509761) ‎ (← links)
• Optimal strong Mal'cev conditions for omitting type 1 in locally finite varieties. (Q2510719) ‎ (← links)
• Dichotomy for finite tournaments of mixed-type (Q2515599) ‎ (← links)
• CSP DICHOTOMY FOR SPECIAL POLYADS (Q2852579) ‎ (← links)
• The Complexity of Approximately Counting Tree Homomorphisms (Q2943573) ‎ (← links)
• On the Complexity of the Model Checking Problem (Q3176188) ‎ (← links)
• Circuit Satisfiability and Constraint Satisfaction Around Skolem Arithmetic (Q3188272) ‎ (← links)
• The Complexity of Counting Quantifiers on Equality Languages (Q3188273) ‎ (← links)
• CSP dichotomy for special triads (Q3395563) ‎ (← links)
• On Planar Boolean CSP (Q3448805) ‎ (← links)
• A Galois Connection for Valued Constraint Languages of Infinite Size (Q3448812) ‎ (← links)
• Necessary Conditions for Tractability of Valued CSPs (Q3455247) ‎ (← links)
• Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems (Q3644743) ‎ (← links)
• Constraint Satisfaction Problems for Reducts of Homogeneous Graphs (Q5232325) ‎ (← links)
• The Power of Linear Programming for General-Valued CSPs (Q5252658) ‎ (← links)
• Constraint Satisfaction with Counting Quantifiers (Q5256528) ‎ (← links)
• Quantified Constraint Satisfaction Problem on Semicomplete Digraphs (Q5278200) ‎ (← links)
• The Complexity of General-Valued CSPs (Q5283238) ‎ (← links)
• Complexity and polymorphisms for digraph constraint problems under some basic constructions (Q5298320) ‎ (← links)
• (Q5743434) ‎ (← links)