1 citations · 1 across the 10 of their papers we have counts for
1 paper · 2 filters
Manuel Bodirsky, Thomas Quinn-Gregson
We study the computational complexity of deciding whether a given set of term equalities and inequalities has a solution in an ω-categorical algebra A. There are ω…