72 citations · 72 across the 2 of their papers we have counts for
1 paper · 1 filter
Manuel Bodirsky, Peter Jonsson, Timo von Oertzen
We study techniques for deciding the computational complexity of infinite-domain constraint satisfaction problems. For certain fundamental algebraic structures Delta, we prove defi…