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):

Displayed 50 items.

• Distance constraint satisfaction problems (Q259047) ‎ (← links)
• A dichotomy for real weighted Holant problems (Q260401) ‎ (← links)
• Constraint satisfaction and semilinear expansions of addition over the rationals and the reals (Q269512) ‎ (← links)
• Tractability in constraint satisfaction problems: a survey (Q271997) ‎ (← links)
• Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies (Q286087) ‎ (← links)
• The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems (Q313398) ‎ (← links)
• Colourings, homomorphisms, and partitions of transitive digraphs (Q338575) ‎ (← links)
• Equivariant algorithms for constraint satisfaction problems over coset templates (Q344534) ‎ (← links)
• Testing list \(H\)-homomorphisms (Q347111) ‎ (← links)
• Constraint satisfaction, irredundant axiomatisability and continuous colouring (Q361864) ‎ (← links)
• Obstructions to partitions of chordal graphs (Q383740) ‎ (← links)
• List-homomorphism problems on graphs and arc consistency (Q393914) ‎ (← links)
• Enumerating homomorphisms (Q414933) ‎ (← links)
• Computing hypergraph width measures exactly (Q437685) ‎ (← links)
• Reflexive digraphs with near unanimity polymorphisms (Q442320) ‎ (← links)
• The complexity of surjective homomorphism problems-a survey (Q444433) ‎ (← links)
• Locally constrained graph homomorphisms -- structure, complexity, and applications (Q458463) ‎ (← links)
• Colouring, constraint satisfaction, and complexity (Q458466) ‎ (← links)
• The complexity of counting quantifiers on equality languages (Q515549) ‎ (← links)
• Key (critical) relations preserved by a weak near-unanimity function (Q522228) ‎ (← links)
• Oriented, 2-edge-colored, and 2-vertex-colored homomorphisms (Q522969) ‎ (← links)
• Rigid binary relations on a 4-element domain (Q523155) ‎ (← links)
• Gap theorems for robust satisfiability: Boolean CSPs and beyond (Q527405) ‎ (← links)
• List H-coloring a graph by removing few vertices (Q527415) ‎ (← links)
• Tractable structures for constraint satisfaction with truth tables (Q537902) ‎ (← links)
• On solvability of systems of polynomial equations (Q539980) ‎ (← links)
• Disjunction property and complexity of substructural logics (Q549720) ‎ (← links)
• Dualities and dual pairs in Heyting algebras (Q603889) ‎ (← links)
• A strong Mal'cev condition for locally finite varieties omitting the unary type (Q616117) ‎ (← links)
• Maltsev digraphs have a majority polymorphism (Q627926) ‎ (← links)
• Hybrid tractability of valued constraint problems (Q646503) ‎ (← links)
• Interleaved adjoints of directed graphs (Q648963) ‎ (← links)
• Regular families of forests, antichains and duality pairs of relational structures (Q681598) ‎ (← links)
• Tractability conditions for numeric CSPs (Q683751) ‎ (← links)
• The complexity of the list homomorphism problem for graphs (Q693060) ‎ (← links)
• Recognizing frozen variables in constraint satisfaction problems (Q706617) ‎ (← links)
• The complexity of counting homomorphisms seen from the other side (Q706636) ‎ (← links)
• Computing vertex-surjective homomorphisms to partially reflexive trees (Q714844) ‎ (← links)
• A polynomial relational class of binary CSP (Q722101) ‎ (← links)
• The complexity of list edge-partitions for simple graphs (Q730267) ‎ (← links)
• Backdoors into heterogeneous classes of SAT and CSP (Q730498) ‎ (← links)
• Connected obstructions to full graph homomorphisms (Q740288) ‎ (← links)
• \(H\)-coloring degree-bounded (acyclic) digraphs (Q744083) ‎ (← links)
• Complexity of planar signed graph homomorphisms to cycles (Q777377) ‎ (← links)
• Homomorphisms of sparse signed graphs (Q782945) ‎ (← links)
• Periodic constraint satisfaction problems: Tractable subclasses (Q816674) ‎ (← links)
• \(H\)-coloring dichotomy revisited (Q817769) ‎ (← links)
• In praise of homomorphisms (Q826325) ‎ (← links)
• Hard constraint satisfaction problems have hard gaps at location 1 (Q837178) ‎ (← links)
• The complexity of weighted Boolean \#CSP with mixed signs (Q837186) ‎ (← links)