Moser-Tardos Algorithm with small number of random bits

Endre Csóka, Łukasz Grabowski, András Máthé +2

We study a variant of the parallel Moser-Tardos Algorithm. We prove that if we restrict attention to a class of problems whose dependency graphs have subexponential growth, then th…