Core Concepts
Study of a variant of the Moser-Tardos Algorithm focusing on problems with subexponential growth dependency graphs.
Abstract
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.
Stats
우리는 기대되는 총 랜덤 비트 수가 일정함을 증명합니다.
서브지수적 성장 의존성 그래프를 가진 문제에 대한 변형 알고리즘을 연구합니다.
만족하는 할당을 찾기 위한 결정론적 알고리즘을 소개합니다.
Lovász Local Lemma의 Borel 버전을 제시합니다.
Quotes
"We study a variant of the parallel Moser-Tardos Algorithm."
"We prove that the expected total number of random bits used by the algorithm is constant."