72 citations · 368 across the 79 of their papers we have counts for
Showing 2023 · math.LOShow all
2 papers · 2 filters
math.LO2023★ 1 cited
The Complexity of Resilience Problems via Valued Constraint Satisfaction
Manuel Bodirsky, Žaneta Semanišinová, Carsten Lutz
Valued constraint satisfaction problems (VCSPs) constitute a large class of computational optimization problems. It was shown recently that, over finite domains, every VCSP is in P…
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…