Pages that link to "Item:Q5310636"
From MaRDI portal
The following pages link to Linear Datalog and Bounded Path Duality of Relational Structures (Q5310636):
Displayed 16 items.
- The complexity of approximately counting stable roommate assignments (Q440007) (← links)
- The complexity of approximately counting stable matchings (Q441846) (← links)
- The complexity of the list homomorphism problem for graphs (Q693060) (← links)
- CSP duality and trees of bounded pathwidth (Q986555) (← 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)
- A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\) (Q2144172) (← links)
- On Maltsev digraphs (Q2260621) (← links)
- Majority constraints have bounded pathwidth duality (Q2427535) (← links)
- On Maltsev Digraphs (Q3007626) (← links)
- (Q4643956) (← links)
- (Q4993594) (← links)
- Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs (Q5203794) (← links)
- Dualities for Constraint Satisfaction Problems (Q5504701) (← links)
- The smallest hard trees (Q6073305) (← links)