activity
20192025
most citedThe Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom

2 citations · 2 across the 3 of their papers we have counts for

collaborators
Showing 2025Show all

1 paper · 1 filter

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…