Oct 11, 2016 · This answers an open problem of Schulman. One major application of these algorithms is an NC algorithm for the Lovász Local Lemma. Previous NC ...

One major application of these algorithms is an NC algorithm for the Lovász Local Lemma. Previous NC algorithms, including the seminal algorithm of Moser and ...

Jan 4, 2017 · As a major application of this, we give an NC algorithm for the Lovász Local Lemma. Previous NC algorithms, including the seminal algorithm of ...

Many randomized algorithms can be derandomized efficiently using either the method of conditional ex- pectations or probability spaces with low (almost-) ...

This work gives a new algorithm to generate a probability space which can fool a given set of neighborhoods, and uses this for an NC2 algorithm for ...

The Lovasz local lemma (1975) is a tool that enables one to show that certain events hold with positive, though very small probability. It often yields ...

Deterministic parallel algorithms for fooling polylogarithmic juntas and the Lovász Local Lemma. David G. Harris∗. November 1, 2016. Abstract. Many randomized ...

Bibliographic details on Deterministic parallel algorithms for fooling polylogarithmic juntas and the Lovasz Local Lemma.

Bibliographic details on Deterministic parallel algorithms for fooling polylogarithmic juntas and the Lovász Local Lemma.

Apr 15, 2023 · Deterministic parallel algorithms for fooling polylogarithmic juntas and the Lovász local lemma, ACM Trans. Algorithm 14 (2018), no. 4, 47.