The article discusses a variant of the Moser-Tardos Algorithm, proving that the expected total number of random bits used is constant for problems with subexponential growth dependency graphs. It introduces a deterministic algorithm for finding a satisfying assignment and a Borel version of the Lovász Local Lemma. The content is structured into sections covering Introduction, Algorithm and Results, Analysis of the Algorithm, and Borel Version of the Lovász Local Lemma. Key insights include the use of random bits for resampling variables and the application of the algorithm to various classes of problems.
다른 언어로
소스 콘텐츠 기반
arxiv.org
더 깊은 질문