2 citations · 2 across the 3 of their papers we have counts for
1 paper · 2 filters
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…