Date of Award
Campus Access Thesis
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 problem.
Kay, W.(2012). An Overview of the Constructive Local Lemma. (Master's thesis). Retrieved from http://scholarcommons.sc.edu/etd/1602