101 citations · 355 across the 29 of their papers we have counts for
4 papers · 1 filter
Commutativity in the Algorithmic Lovasz Local Lemma
Vladimir Kolmogorov
We consider the recent formulation of the Algorithmic Lovász Local Lemma [10,2,3] for finding objects that avoid `bad features', or `flaws'. It extends the Moser-Tardos resampling…
Effectiveness of Structural Restrictions for Hybrid CSPs
Vladimir Kolmogorov, Michal Rolinek, Rustem Takhanov
Constraint Satisfaction Problem (CSP) is a fundamental algorithmic problem that appears in many areas of Computer Science. It can be equivalently stated as computing a homomorphism…
Total variation on a tree
Vladimir Kolmogorov, Thomas Pock, Michal Rolinek
We consider the problem of minimizing the continuous valued total variation subject to different unary terms on trees and propose fast direct algorithms based on dynamic programmin…
The Complexity of General-Valued CSPs
Vladimir Kolmogorov, Andrei Krokhin, Michal Rolinek
An instance of the Valued Constraint Satisfaction Problem (VCSP) is given by a finite set of variables, a finite domain of labels, and a sum of functions, each function depending o…