Abstract
dc:description.abstract<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 problem.</p>
Degree
thesis:*- Name thesis:degree_name
- M.A.
- Level thesis:degree_level
- Campus Access Thesis
- Discipline thesis:degree_discipline
- Mathematics
- Year
- 2012
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Kay, William
- Contributors dc:contributor
-
- Joshua Cooper
Subjects
dc:subject × 6Rights
dc:rights- Statement dc:rights
-
- © 2012, William Kay
Identifiers
dc:identifier.*- Repository record dc:identifier
- https://scholarcommons.sc.edu/etd/1602
- OAI identifier oai:identifier
- oai:scholarcommons.sc.edu:etd-2603