Date of Award
1-1-2012
Document Type
Campus Access Thesis
Department
Mathematics
First Advisor
Joshua Cooper
Abstract
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.
Rights
© 2012, William Kay
Recommended Citation
Kay, W.(2012). An Overview of the Constructive Local Lemma. (Master's thesis). Retrieved from https://scholarcommons.sc.edu/etd/1602
COinS