Pages that link to "Item:Q5453499"
From MaRDI portal
The following pages link to A Characterisation of First-Order Constraint Satisfaction Problems (Q5453499):
Displaying 31 items.
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- Constraint satisfaction, irredundant axiomatisability and continuous colouring (Q361864) (← links)
- List-homomorphism problems on graphs and arc consistency (Q393914) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- Dualities and dual pairs in Heyting algebras (Q603889) (← links)
- Regular families of forests, antichains and duality pairs of relational structures (Q681598) (← links)
- The complexity of the list homomorphism problem for graphs (Q693060) (← links)
- Absolute retracts and varieties generated by chordal graphs (Q968425) (← links)
- Universal algebra and hardness results for constraint satisfaction problems (Q1014634) (← links)
- Affine systems of equations and counting infinitary logic (Q1014638) (← links)
- The complexity of satisfiability problems: Refining Schaefer's theorem (Q1015812) (← links)
- Relativised homomorphism preservation at the finite level (Q1680516) (← links)
- Low-level dichotomy for quantified constraint satisfaction problems (Q1944186) (← links)
- A tetrachotomy of ontology-mediated queries with a covering axiom (Q2152500) (← links)
- Dismantlability, connectedness, and mixing in relational structures (Q2222042) (← links)
- On digraph coloring problems and treewidth duality (Q2427534) (← links)
- Majority constraints have bounded pathwidth duality (Q2427535) (← links)
- Generalised dualities and maximal finite antichains in the homomorphism order of relational structures (Q2427538) (← links)
- Majority functions on structures with finite duality (Q2427545) (← links)
- Graph partitions with prescribed patterns (Q2509761) (← links)
- (Q3304148) (← links)
- NU Polymorphisms on Reflexive Digraphs (Q4610183) (← links)
- A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNP (Q4957913) (← links)
- Algebra and the Complexity of Digraph CSPs: a Survey (Q4993603) (← links)
- Dismantlability, Connectedness, and Mixing in Relational Structures (Q5091178) (← links)
- Complexity and polymorphisms for digraph constraint problems under some basic constructions (Q5298320) (← links)
- (Q5377468) (← links)
- Recent Results on the Algebraic Approach to the CSP (Q5504700) (← links)
- Dualities for Constraint Satisfaction Problems (Q5504701) (← links)
- Topology and Adjunction in Promise Constraint Satisfaction (Q5885596) (← links)
- The algebraic structure of the densification and the sparsification tasks for CSPs (Q6080503) (← links)
