Variant of parallel Moser-Tardos algorithm reuses random bits across distant variables in subexponentially growing dependency graphs to achieve constant expected randomness, enabling O(n) deterministic solving and Borel LLL.
Pikhurko,Borel combinatorics of locally finite graphs, Surveys in combinatorics, 2021, pp
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2022 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Moser-Tardos Algorithm with small number of random bits
Variant of parallel Moser-Tardos algorithm reuses random bits across distant variables in subexponentially growing dependency graphs to achieve constant expected randomness, enabling O(n) deterministic solving and Borel LLL.