Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 5 of 5 for “"Local Lemma"”.
-
An Overview of the Constructive Local Lemma
<p>The Local Lemma has been a powerful tool in probabilistic combinatorics. Recent advances by Moser and Tardos have provided an algorithmic variant of the Local Lemma. We provide an overview of the analysis of their algorithm, and provide an implementation of the algorithm to a hypergraph coloring …
-
Deterministic algorithms for the Lovász Local Lemma
The Lovász Local Lemma [6] (LLL) is a powerful result in probability theory that states that the probability that none of a set of bad events happens is nonzero if the probability of each event is small compared to the number of events that depend on it. It is often used in combination with the …
-
Coloring problems in combinatorics and descriptive set theory
… 1, we establish a generalization of the Lovász Local Lemma (a powerful tool in probabilistic combinatorics), which we call the Local Cut Lemma, and apply it to a variety of problems in graph coloring. In Chapter 2, we study DP-coloring (also known as correspondence coloring)—an extension of list …
-
Probabilistic methods for distributed information dissemination
… context by studying algorithms for the Lovász Local Lemma. These algorithms find solutions to certain local constraint satisfaction problems by randomly fixing and propagating violations locally. Our two main results show that, firstly, there are also efficient deterministic propagation …