Local Computation Algorithms for the Lov\'{a}sz Local Lemma

We consider the task of designing Local Computation Algorithms (LCA) for applications of the Lovu0027{a}sz Local Lemma (LLL). LCA is a class of sublinear algorithms proposed by Rubinfeld et al. that have received a lot of attention in recent years. The LLL is an existential, sufficient condition for a collection of sets to have non-empty ...More