72 citations · 368 across the 79 of their papers we have counts for
Showing 2025 · math.RAShow all
2 papers · 2 filters
math.RA2025
Network Satisfaction over Four-Atom Relation Algebras: Complexity and Representations
Manuel Bodirsky, Moritz Jahn, Simon Knäuer +2
Andréka and Maddux classified the relation algebras with at most 3 atoms, and in particular they showed that all of them are representable. Cristani and Hirsch showed that the netw…
math.RA2025
Conservative Maltsev Constraint Satisfaction Problems
Manuel Bodirsky, Andrew Moorhead
One of the central open problems to classify the computational complexity of finite-domain constraint satisfaction problems within P is to prove better algorithmic results for CSPs…