Local Computation Algorithms for Hypergraph Coloring -- following Beck's approach (full version)

We investigate local computation algorithms (LCA) for two-coloring of $k$-uniform hypergraphs. We focus on hypergraph instances that satisfy strengthened assumption of the Lov\'{a}sz Local Lemma of the form $2^{1-\alpha k} (\Delta+1) \mathrm{e} < 1$, where $\Delta$ is the bound on the maximum edge degree. The main question which arises here is for how large $\alpha$ there exists an LCA that is able to properly color such hypergraphs in polylogarithmic time per query. We describe briefly how upgrading the classical sequential procedure of Beck from 1991 with Moser and Tardos' RESAMPLE yields polylogarithmic LCA that works for $\alpha$ up to $1/4$. Then, we present an improved procedure that solves wider range of instances by allowing $\alpha$ up to $1/3$.
Comment: Full version of the paper accepted for the ICALP 2023 conference (additional appendixes B, C, D)