78 citations · 97 across the 5 of their papers we have counts for
Showing math.RAShow all
2 papers · 1 filter
math.RA2022
The Smallest Hard Trees
Manuel Bodirsky, Jakub Bulín, Florian Starke +1
We find an orientation of a tree with 20 vertices such that the corresponding fixed-template constraint satisfaction problem (CSP) is NP-complete, and prove that for every orientat…
math.RA2016
Deciding absorption in relational structures
Libor Barto, Jakub Bulín
We prove that for finite, finitely related algebras the concepts of an absorbing subuniverse and a Jónsson absorbing subuniverse coincide. Consequently, it is decidable whether a g…