109 citations · 130 across the 17 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
math.RA2015
Deciding absorption
Libor Barto, Alexandr Kazda
We characterize absorption in finite idempotent algebras by means of Jónsson absorption and cube term blockers. As an application we show that it is decidable whether a given subse…
cs.CC2015
Robustly Solvable Constraint Satisfaction Problems
Libor Barto, Marcin Kozik
An algorithm for a constraint satisfaction problem is called robust if it outputs an assignment satisfying at least -fraction of the constraints given a $(1-\va…
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…