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 math.LOShow all

2 papers · 1 filter

math.LO2023

Network Satisfaction Problems Solved by k-Consistency

Manuel Bodirsky, Simon Knäuer

We show that the problem of deciding for a given finite relation algebra A whether the network satisfaction problem for A can be solved by the k-consistency procedure, for some nat…

math.LO2020★ 2 cited

The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom

Manuel Bodirsky, Simon Knäuer

Robin Hirsch posed in 1996 the 'Really Big Complexity Problem': classify the computational complexity of the network satisfaction problem for all finite relation algebras A. We pro…