Pages that link to "Item:Q4210136"

The following pages link to The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory (Q4210136):

Displaying 50 items.

• A discrete homotopy theory for binary reflexive structures (Q1763635) (← links)
• A new tractable class of constraint satisfaction problems (Q1776199) (← links)
• Uniform and nonuniform recognizability. (Q1853746) (← links)
• Strong near subgroups and left gyrogroups (Q1867305) (← links)
• Algebra complexity problems involving graph homomorphism, semigroups and the constraint satisfaction problem (Q1869963) (← links)
• Dichotomies for classes of homomorphism problems involving unary functions (Q1884913) (← links)
• The complexity of minimal satisfiability problems (Q1887137) (← links)
• The complexity of approximating bounded-degree Boolean \(\#\)CSP (Q1932171) (← links)
• From Holant to \#CSP and back: dichotomy for Holant\(^{c}\) problems (Q1934313) (← links)
• On finitely related semigroups. (Q1955601) (← links)
• Constraint satisfaction with succinctly specified relations (Q1959431) (← links)
• On rainbow-free colourings of uniform hypergraphs (Q1981770) (← links)
• Reflexive graphs with near unanimity but no semilattice polymorphisms (Q1991407) (← links)
• Surjective \(H\)-colouring: new hardness results (Q2011662) (← links)
• The complexity of tropical graph homomorphisms (Q2012054) (← links)
• Parameterized counting of partially injective homomorphisms (Q2032353) (← links)
• Reconfiguration of homomorphisms to reflexive digraph cycles (Q2032862) (← links)
• From \(A\) to \(B\) to \(Z\) (Q2037088) (← links)
• Permutation groups with small orbit growth (Q2037519) (← links)
• Galois connections for patterns: an algebra of labelled graphs (Q2044173) (← links)
• Tractable combinations of theories via sampling (Q2055788) (← links)
• Polyadic sets and homomorphism counting (Q2094593) (← links)
• Beyond PCSP (\textbf{1-in-3}, \textbf{NAE}) (Q2105441) (← links)
• ASNP: a tame fragment of existential second-order logic (Q2106601) (← links)
• High girth hypergraphs with unavoidable monochromatic or rainbow edges (Q2118239) (← links)
• Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity (Q2134740) (← links)
• A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\) (Q2144172) (← links)
• A tetrachotomy of ontology-mediated queries with a covering axiom (Q2152500) (← links)
• Emptiness problems for distributed automata (Q2182732) (← links)
• Complexity of correspondence \(H\)-colourings (Q2184689) (← links)
• Using a Min-Cut generalisation to go beyond Boolean surjective VCSPs (Q2211354) (← links)
• A structured view on weighted counting with relations to counting, quantum computation and applications (Q2216125) (← links)
• Dismantlability, connectedness, and mixing in relational structures (Q2222042) (← links)
• The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems (Q2235760) (← links)
• Acyclic orders, partition schemes and CSPs: unified hardness proofs and improved algorithms (Q2238592) (← links)
• Constraint satisfaction problems over semilattice block Mal'tsev algebras (Q2272992) (← links)
• Dichotomy for tree-structured trigraph list homomorphism problems (Q2275926) (← links)
• The \(C_{k}\)-extended graft construction (Q2275937) (← links)
• The number of clones determined by disjunctions of unary relations (Q2322711) (← links)
• A decidable dichotomy theorem on directed graph homomorphisms with non-negative weights (Q2323358) (← links)
• Constructing NP-intermediate problems by blowing holes with parameters of various properties (Q2345449) (← links)
• Commutative idempotent groupoids and the constraint satisfaction problem. (Q2351518) (← links)
• The complexity of signed graph and edge-coloured graph homomorphisms (Q2374178) (← links)
• What makes propositional abduction tractable (Q2389658) (← links)
• On planar valued CSPs (Q2396724) (← links)
• On the speed of constraint propagation and the time complexity of arc consistency testing (Q2409578) (← links)
• The connectivity of Boolean satisfiability: dichotomies for formulas and circuits (Q2411031) (← links)
• Correspondence homomorphisms to reflexive graphs (Q2413143) (← links)
• On digraph coloring problems and treewidth duality (Q2427534) (← links)
• Majority constraints have bounded pathwidth duality (Q2427535) (← links)