109 citations · 130 across the 17 of their papers we have counts for
Showing math.LOShow all
2 papers · 1 filter
math.LO2017
The minimal arity of near-unanimity polymorphisms
Libor Barto, Ondřej Draganov
Dmitriy Zhuk has proved that there exist relational structures which admit near-unanimity polymorphisms, but the minimum arity of such a polymorphism is large and almost matches th…
math.LO2015
The wonderland of reflections
Libor Barto, Jakub Opršal, Michael Pinsker
A fundamental fact for the algebraic theory of constraint satisfaction problems (CSPs) over a fixed template is that pp-interpretations between at most countable ω-categorical rela…