Pages that link to "Item:Q5317171"
From MaRDI portal
The following pages link to Classifying the Complexity of Constraints Using Finite Algebras (Q5317171):
Displaying 50 items.
- A combinatorial constraint satisfaction problem dichotomy classification conjecture (Q1041203) (← links)
- A surprising permanence of old motivations (a not-so-rigid story) (Q1045032) (← links)
- Binary constraint satisfaction problems defined by excluded topological minors (Q1633806) (← links)
- Tropically convex constraint satisfaction (Q1635805) (← links)
- Axiomatisability and hardness for universal Horn classes of hypergraphs (Q1652862) (← links)
- Towards a characterization of constant-factor approximable finite-valued CSPs (Q1671996) (← links)
- Circuit satisfiability and constraint satisfaction around Skolem arithmetic (Q1676359) (← links)
- On the complexity of \(\mathbb{H}\)-coloring for special oriented trees (Q1686250) (← links)
- The power of propagation: when GAC is enough (Q1701225) (← links)
- The wonderland of reflections (Q1709740) (← links)
- On singleton arc consistency for CSPs defined by monotone patterns (Q1739115) (← links)
- On bijunctive predicates over a finite set (Q1741483) (← links)
- Constants and finite unary relations in qualitative constraint reasoning (Q1749385) (← links)
- Low-level dichotomy for quantified constraint satisfaction problems (Q1944186) (← links)
- Generic expression hardness results for primitive positive formula comparison (Q1951576) (← links)
- The complexity of problems for quantified constraints (Q1959381) (← links)
- On rainbow-free colourings of uniform hypergraphs (Q1981770) (← links)
- Galois connections for patterns: an algebra of labelled graphs (Q2044173) (← links)
- Beyond PCSP (\textbf{1-in-3}, \textbf{NAE}) (Q2105441) (← links)
- On a stronger reconstruction notion for monoids and clones (Q2121508) (← 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 computational complexity of disconnected cut and \(2 K_2\)-partition (Q2259853) (← links)
- On Maltsev digraphs (Q2260621) (← links)
- Constraint satisfaction problems over semilattice block Mal'tsev algebras (Q2272992) (← links)
- The \(C_{k}\)-extended graft construction (Q2275937) (← links)
- Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns (Q2341755) (← links)
- Constructing NP-intermediate problems by blowing holes with parameters of various properties (Q2345449) (← links)
- A quasi-Mal'cev condition with unexpected application. (Q2351514) (← links)
- Commutative idempotent groupoids and the constraint satisfaction problem. (Q2351518) (← links)
- Domain permutation reduction for constraint satisfaction problems (Q2389649) (← links)
- On planar valued CSPs (Q2396724) (← links)
- Finite bands are finitely related (Q2413514) (← links)
- Majority constraints have bounded pathwidth duality (Q2427535) (← links)
- Generalised dualities and maximal finite antichains in the homomorphism order of relational structures (Q2427538) (← links)
- The complexity of soft constraint satisfaction (Q2457608) (← links)
- Complexity of clausal constraints over chains (Q2480746) (← links)
- Combinatorial problems raised from 2-semilattices (Q2496183) (← links)
- Decidability of absorption in relational structures of bounded width. (Q2510713) (← links)
- Dichotomy for finite tournaments of mixed-type (Q2515599) (← links)
- CSP for binary conservative relational structures (Q2634708) (← links)
- An application of Farkas' lemma to finite-valued constraint satisfaction problems over infinite domains (Q2674328) (← links)
- The constraint satisfaction problem and universal algebra (Q2795309) (← links)
- Schaefer's theorem for graphs (Q2796406) (← links)
- Robustly solvable constraint satisfaction problems (Q2817797) (← links)
- Minimum Cost Homomorphisms with Constrained Costs (Q2817862) (← links)
- On algebras with many symmetric operations (Q2821826) (← links)
- CSP dichotomy for special polyads (Q2852579) (← links)
- Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs (Q2884255) (← links)
- Is Polynomial Time Choiceless? (Q2947174) (← links)
