2000 character limit reached
An alternative proof for the constructive Asymmetric Lovász Local Lemma
Published 11 May 2015 in cs.DM and math.CO | (1505.02568v1)
Abstract: We provide an alternative constructive proof of the Asymmetric Lov\'asz Local Lemma. Our proof uses the classic algorithmic framework of Moser and the analysis introduced by Giotis, Kirousis, Psaromiligkos, and Thilikos in "On the algorithmic Lov\'asz Local Lemma and acyclic edge coloring", combined with the work of Bender and Richmond on the multivariable Lagrange Inversion formula.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.