[2203.05888] Moser-Tardos Algorithm with small number of random bits Skip to main content Search Submit Donate Log in Search arXiv Press Enter to search · Advanced search Mathematics > Combinatorics arXiv:2203.05888 (math) [Submitted on 11 Mar 2022 ( v1 ), last revised 1 Aug 2026 (this version, v4)] Title: Moser-Tardos Algorithm with small number of random bits Authors: Endre Csóka , Łukasz Grabowski , András Máthé , Oleg Pikhurko , Konstantinos Tyros View a PDF of the paper titled Moser-Tardos Algorithm with small number of random bits, by Endre Cs\'oka and 4 other authors View PDF HTML (experimental) Abstract: We study a variant of the parallel Moser-Tardos Algorithm. We prove that if we restrict attention to a class of problems whose dependency graphs have subexponential growth, then the expected total number of random bits used by the algorithm is constant; in particular, it is independent from the number of variables. This is achieved by using the same random bits to resample variables which are far enough in the dependency graph. There are two corollaries. First, we obtain a deterministic algorithm for finding a satisfying assignment, which for any class of problems as in the previous paragraph runs in time O(n), where n is the number of variables. Second, we present a Borel version of the Lovász Local Lemma. Comments: 34 pages; minor revision; accepted by JEMS Subjects: Combinatorics (math.CO) ; Distributed, Parallel, and Cluster Computing (cs.DC); Data Structures and Algorithms (cs.DS); Logic (math.LO) Cite as: arXiv:2203.05888 [math.CO] (or arXiv:2203.05888v4 [math.CO] for this version) https://doi.org/10.48550/arXiv.2203.05888 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Oleg Pikhurko [ view email ] [v1] Fri, 11 Mar 2022 12:46:06 UTC (42 KB) [v2] Mon, 4 Mar 2024 17:04:35 UTC (210 KB) [v3] Fri, 24 Apr 2026 06:34:31 UTC (52 KB) [v4] Sat, 1 Aug 2026 04:32:24 UTC (70 KB) Full-text links: Access Paper: View a PDF of the paper titled Moser-Tardos Algorithm with small number of random bits, by Endre Cs\'oka and 4 other authors View PDF HTML (experimental) TeX Source view license Current browse context: math.CO < prev | next > new | recent | 2022-03 Change to browse by: cs cs.DC cs.DS math math.LO References & Citations NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps? ) scite.ai Toggle scite Smart Citations ( What are Smart Citations? ) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv ( What is alphaXiv? ) Links to Code Toggle CatalyzeX Code Finder for Papers ( What is CatalyzeX? ) DagsHub Toggle DagsHub ( What is DagsHub? ) GotitPub Toggle Gotit.pub ( What is GotitPub? ) Huggingface Toggle Hugging Face ( What is Huggingface? ) ScienceCast Toggle ScienceCast ( What is ScienceCast? ) Demos Demos Replicate Toggle Replicate ( What is Replicate? ) Spaces Toggle Hugging Face Spaces ( What is Spaces? ) Spaces Toggle TXYZ.AI ( What is TXYZ.AI? ) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower ( What are Influence Flowers? ) Core recommender toggle CORE Recommender ( What is CORE? ) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs . Which authors of this paper are endorsers? | Disable MathJax ( What is MathJax? ) We gratefully acknowledge support from our major funders , member institutions , , and all contributors. About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab) Major funding support from